./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8decbf03b3907891ee2275cc5a173997543a0c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 12:26:30,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:26:30,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:26:30,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:26:30,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:26:30,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:26:30,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:26:30,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:26:30,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:26:30,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:26:30,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:26:30,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:26:30,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:26:30,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:26:30,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:26:30,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:26:30,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:26:30,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:26:30,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:26:30,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:26:30,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:26:30,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:26:30,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:26:30,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:26:30,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:26:30,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:26:30,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:26:30,136 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:26:30,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:26:30,137 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:26:30,137 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:26:30,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:26:30,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:26:30,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:26:30,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:26:30,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:26:30,139 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 12:26:30,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:26:30,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:26:30,146 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 12:26:30,146 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 12:26:30,147 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:26:30,147 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:26:30,147 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 12:26:30,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:26:30,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:26:30,147 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:26:30,147 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:26:30,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 12:26:30,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:26:30,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 12:26:30,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 12:26:30,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:26:30,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:26:30,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 12:26:30,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 12:26:30,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:26:30,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 12:26:30,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8decbf03b3907891ee2275cc5a173997543a0c3 [2018-12-08 12:26:30,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:26:30,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:26:30,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:26:30,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:26:30,178 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:26:30,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_pso.opt_false-unreach-call.i [2018-12-08 12:26:30,215 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/data/a7a442f36/c3c1adf7dd4b4725b263237ee0933b0f/FLAG54758e47e [2018-12-08 12:26:30,566 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:26:30,566 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/sv-benchmarks/c/pthread-wmm/mix035_pso.opt_false-unreach-call.i [2018-12-08 12:26:30,573 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/data/a7a442f36/c3c1adf7dd4b4725b263237ee0933b0f/FLAG54758e47e [2018-12-08 12:26:30,581 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/data/a7a442f36/c3c1adf7dd4b4725b263237ee0933b0f [2018-12-08 12:26:30,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:26:30,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:26:30,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:26:30,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:26:30,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:26:30,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30, skipping insertion in model container [2018-12-08 12:26:30,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:26:30,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:26:30,794 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:26:30,802 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:26:30,880 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:26:30,910 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:26:30,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30 WrapperNode [2018-12-08 12:26:30,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:26:30,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:26:30,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:26:30,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:26:30,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:26:30,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:26:30,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:26:30,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:26:30,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... [2018-12-08 12:26:30,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:26:30,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:26:30,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:26:30,964 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:26:30,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 12:26:31,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 12:26:31,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 12:26:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 12:26:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 12:26:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 12:26:31,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 12:26:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 12:26:31,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 12:26:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 12:26:31,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 12:26:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 12:26:31,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:26:31,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:26:31,006 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 12:26:31,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:26:31,305 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 12:26:31,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:26:31 BoogieIcfgContainer [2018-12-08 12:26:31,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:26:31,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 12:26:31,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 12:26:31,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 12:26:31,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 12:26:30" (1/3) ... [2018-12-08 12:26:31,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507510b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 12:26:31, skipping insertion in model container [2018-12-08 12:26:31,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:26:30" (2/3) ... [2018-12-08 12:26:31,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507510b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 12:26:31, skipping insertion in model container [2018-12-08 12:26:31,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:26:31" (3/3) ... [2018-12-08 12:26:31,311 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_false-unreach-call.i [2018-12-08 12:26:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,339 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,339 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,340 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,340 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,341 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,342 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,343 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,343 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,343 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,343 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,343 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,343 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,344 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,345 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,345 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,345 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,345 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,345 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,345 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,345 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,346 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,347 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,347 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,347 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,347 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,347 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,347 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,347 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,352 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,353 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,354 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,354 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,354 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,355 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,355 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,355 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,355 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,355 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,356 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,359 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 12:26:31,364 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 12:26:31,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 12:26:31,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 12:26:31,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 12:26:31,394 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 12:26:31,394 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 12:26:31,394 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 12:26:31,394 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 12:26:31,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 12:26:31,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 12:26:31,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 12:26:31,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 12:26:31,394 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 12:26:31,401 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147places, 178 transitions [2018-12-08 12:26:50,535 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149046 states. [2018-12-08 12:26:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 149046 states. [2018-12-08 12:26:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 12:26:50,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:26:50,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:26:50,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:26:50,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:26:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash 585073781, now seen corresponding path program 1 times [2018-12-08 12:26:50,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:26:50,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:26:50,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:26:50,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:26:50,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:26:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:26:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:26:50,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:26:50,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:26:50,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:26:50,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:26:50,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:26:50,712 INFO L87 Difference]: Start difference. First operand 149046 states. Second operand 4 states. [2018-12-08 12:26:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:26:52,120 INFO L93 Difference]: Finished difference Result 257066 states and 1188605 transitions. [2018-12-08 12:26:52,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:26:52,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 12:26:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:26:52,722 INFO L225 Difference]: With dead ends: 257066 [2018-12-08 12:26:52,722 INFO L226 Difference]: Without dead ends: 174816 [2018-12-08 12:26:52,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:26:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174816 states. [2018-12-08 12:26:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174816 to 110556. [2018-12-08 12:26:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110556 states. [2018-12-08 12:26:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110556 states to 110556 states and 511487 transitions. [2018-12-08 12:26:57,953 INFO L78 Accepts]: Start accepts. Automaton has 110556 states and 511487 transitions. Word has length 47 [2018-12-08 12:26:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:26:57,954 INFO L480 AbstractCegarLoop]: Abstraction has 110556 states and 511487 transitions. [2018-12-08 12:26:57,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:26:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 110556 states and 511487 transitions. [2018-12-08 12:26:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 12:26:57,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:26:57,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:26:57,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:26:57,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:26:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 188144804, now seen corresponding path program 1 times [2018-12-08 12:26:57,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:26:57,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:26:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:26:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:26:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:26:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:26:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:26:58,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:26:58,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:26:58,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:26:58,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:26:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:26:58,011 INFO L87 Difference]: Start difference. First operand 110556 states and 511487 transitions. Second operand 3 states. [2018-12-08 12:26:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:26:58,596 INFO L93 Difference]: Finished difference Result 110556 states and 511382 transitions. [2018-12-08 12:26:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:26:58,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-08 12:26:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:26:58,916 INFO L225 Difference]: With dead ends: 110556 [2018-12-08 12:26:58,916 INFO L226 Difference]: Without dead ends: 110556 [2018-12-08 12:26:58,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:26:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110556 states. [2018-12-08 12:27:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110556 to 110556. [2018-12-08 12:27:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110556 states. [2018-12-08 12:27:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110556 states to 110556 states and 511382 transitions. [2018-12-08 12:27:01,406 INFO L78 Accepts]: Start accepts. Automaton has 110556 states and 511382 transitions. Word has length 55 [2018-12-08 12:27:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:01,406 INFO L480 AbstractCegarLoop]: Abstraction has 110556 states and 511382 transitions. [2018-12-08 12:27:01,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:27:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 110556 states and 511382 transitions. [2018-12-08 12:27:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 12:27:01,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:01,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:27:01,414 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:01,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1930955139, now seen corresponding path program 1 times [2018-12-08 12:27:01,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:01,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:01,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:01,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:27:01,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:27:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:27:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:27:01,454 INFO L87 Difference]: Start difference. First operand 110556 states and 511382 transitions. Second operand 4 states. [2018-12-08 12:27:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:01,884 INFO L93 Difference]: Finished difference Result 99454 states and 448607 transitions. [2018-12-08 12:27:01,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:27:01,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-08 12:27:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:02,122 INFO L225 Difference]: With dead ends: 99454 [2018-12-08 12:27:02,123 INFO L226 Difference]: Without dead ends: 95224 [2018-12-08 12:27:02,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:27:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95224 states. [2018-12-08 12:27:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95224 to 95224. [2018-12-08 12:27:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95224 states. [2018-12-08 12:27:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95224 states to 95224 states and 432991 transitions. [2018-12-08 12:27:04,322 INFO L78 Accepts]: Start accepts. Automaton has 95224 states and 432991 transitions. Word has length 55 [2018-12-08 12:27:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:04,323 INFO L480 AbstractCegarLoop]: Abstraction has 95224 states and 432991 transitions. [2018-12-08 12:27:04,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:27:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 95224 states and 432991 transitions. [2018-12-08 12:27:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 12:27:04,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:04,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:27:04,329 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:04,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash -843007537, now seen corresponding path program 1 times [2018-12-08 12:27:04,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:04,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:04,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:04,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:27:04,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:27:04,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:27:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:27:04,370 INFO L87 Difference]: Start difference. First operand 95224 states and 432991 transitions. Second operand 5 states. [2018-12-08 12:27:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:07,160 INFO L93 Difference]: Finished difference Result 208036 states and 909703 transitions. [2018-12-08 12:27:07,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:27:07,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-08 12:27:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:07,701 INFO L225 Difference]: With dead ends: 208036 [2018-12-08 12:27:07,701 INFO L226 Difference]: Without dead ends: 205116 [2018-12-08 12:27:07,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:27:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205116 states. [2018-12-08 12:27:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205116 to 137860. [2018-12-08 12:27:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137860 states. [2018-12-08 12:27:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137860 states to 137860 states and 606396 transitions. [2018-12-08 12:27:11,045 INFO L78 Accepts]: Start accepts. Automaton has 137860 states and 606396 transitions. Word has length 56 [2018-12-08 12:27:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:11,045 INFO L480 AbstractCegarLoop]: Abstraction has 137860 states and 606396 transitions. [2018-12-08 12:27:11,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:27:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 137860 states and 606396 transitions. [2018-12-08 12:27:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 12:27:11,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:11,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] [2018-12-08 12:27:11,051 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:11,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -484759346, now seen corresponding path program 1 times [2018-12-08 12:27:11,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:11,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:11,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:11,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:11,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:27:11,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:27:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:27:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:27:11,097 INFO L87 Difference]: Start difference. First operand 137860 states and 606396 transitions. Second operand 5 states. [2018-12-08 12:27:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:12,438 INFO L93 Difference]: Finished difference Result 270772 states and 1181674 transitions. [2018-12-08 12:27:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:27:12,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-08 12:27:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:13,600 INFO L225 Difference]: With dead ends: 270772 [2018-12-08 12:27:13,600 INFO L226 Difference]: Without dead ends: 268197 [2018-12-08 12:27:13,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:27:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268197 states. [2018-12-08 12:27:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268197 to 153577. [2018-12-08 12:27:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153577 states. [2018-12-08 12:27:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153577 states to 153577 states and 670976 transitions. [2018-12-08 12:27:19,720 INFO L78 Accepts]: Start accepts. Automaton has 153577 states and 670976 transitions. Word has length 56 [2018-12-08 12:27:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:19,720 INFO L480 AbstractCegarLoop]: Abstraction has 153577 states and 670976 transitions. [2018-12-08 12:27:19,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:27:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 153577 states and 670976 transitions. [2018-12-08 12:27:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 12:27:19,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:19,729 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-08 12:27:19,729 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:19,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1508119156, now seen corresponding path program 1 times [2018-12-08 12:27:19,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:19,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:19,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:19,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:19,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:27:19,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:27:19,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:27:19,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:27:19,748 INFO L87 Difference]: Start difference. First operand 153577 states and 670976 transitions. Second operand 3 states. [2018-12-08 12:27:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:20,642 INFO L93 Difference]: Finished difference Result 200749 states and 862356 transitions. [2018-12-08 12:27:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:27:20,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-08 12:27:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:21,153 INFO L225 Difference]: With dead ends: 200749 [2018-12-08 12:27:21,153 INFO L226 Difference]: Without dead ends: 200729 [2018-12-08 12:27:21,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:27:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200729 states. [2018-12-08 12:27:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200729 to 174143. [2018-12-08 12:27:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174143 states. [2018-12-08 12:27:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174143 states to 174143 states and 754707 transitions. [2018-12-08 12:27:24,982 INFO L78 Accepts]: Start accepts. Automaton has 174143 states and 754707 transitions. Word has length 58 [2018-12-08 12:27:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:24,983 INFO L480 AbstractCegarLoop]: Abstraction has 174143 states and 754707 transitions. [2018-12-08 12:27:24,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:27:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 174143 states and 754707 transitions. [2018-12-08 12:27:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 12:27:25,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:25,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:27:25,006 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:25,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:25,006 INFO L82 PathProgramCache]: Analyzing trace with hash 979024319, now seen corresponding path program 1 times [2018-12-08 12:27:25,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:25,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:25,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:25,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:25,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:25,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:25,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:27:25,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:27:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:27:25,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:27:25,080 INFO L87 Difference]: Start difference. First operand 174143 states and 754707 transitions. Second operand 6 states. [2018-12-08 12:27:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:28,567 INFO L93 Difference]: Finished difference Result 300091 states and 1289133 transitions. [2018-12-08 12:27:28,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 12:27:28,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-08 12:27:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:29,345 INFO L225 Difference]: With dead ends: 300091 [2018-12-08 12:27:29,345 INFO L226 Difference]: Without dead ends: 297046 [2018-12-08 12:27:29,345 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-08 12:27:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297046 states. [2018-12-08 12:27:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297046 to 176097. [2018-12-08 12:27:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176097 states. [2018-12-08 12:27:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176097 states to 176097 states and 764722 transitions. [2018-12-08 12:27:33,776 INFO L78 Accepts]: Start accepts. Automaton has 176097 states and 764722 transitions. Word has length 62 [2018-12-08 12:27:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:33,776 INFO L480 AbstractCegarLoop]: Abstraction has 176097 states and 764722 transitions. [2018-12-08 12:27:33,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:27:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 176097 states and 764722 transitions. [2018-12-08 12:27:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 12:27:33,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:33,803 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] [2018-12-08 12:27:33,804 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:33,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:33,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2067287304, now seen corresponding path program 1 times [2018-12-08 12:27:33,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:33,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:33,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:33,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:33,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:33,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:33,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:27:33,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:27:33,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:27:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:27:33,875 INFO L87 Difference]: Start difference. First operand 176097 states and 764722 transitions. Second operand 6 states. [2018-12-08 12:27:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:35,517 INFO L93 Difference]: Finished difference Result 240021 states and 1032366 transitions. [2018-12-08 12:27:35,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:27:35,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-08 12:27:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:36,137 INFO L225 Difference]: With dead ends: 240021 [2018-12-08 12:27:36,137 INFO L226 Difference]: Without dead ends: 235465 [2018-12-08 12:27:36,137 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-08 12:27:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235465 states. [2018-12-08 12:27:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235465 to 220997. [2018-12-08 12:27:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220997 states. [2018-12-08 12:27:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220997 states to 220997 states and 954038 transitions. [2018-12-08 12:27:43,534 INFO L78 Accepts]: Start accepts. Automaton has 220997 states and 954038 transitions. Word has length 63 [2018-12-08 12:27:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:43,534 INFO L480 AbstractCegarLoop]: Abstraction has 220997 states and 954038 transitions. [2018-12-08 12:27:43,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:27:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 220997 states and 954038 transitions. [2018-12-08 12:27:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 12:27:43,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:43,570 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] [2018-12-08 12:27:43,570 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:43,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash 430728633, now seen corresponding path program 1 times [2018-12-08 12:27:43,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:43,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:43,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:43,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:43,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:43,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:43,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:27:43,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:27:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:27:43,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:27:43,623 INFO L87 Difference]: Start difference. First operand 220997 states and 954038 transitions. Second operand 7 states. [2018-12-08 12:27:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:45,681 INFO L93 Difference]: Finished difference Result 315729 states and 1321475 transitions. [2018-12-08 12:27:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 12:27:45,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-12-08 12:27:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:46,496 INFO L225 Difference]: With dead ends: 315729 [2018-12-08 12:27:46,496 INFO L226 Difference]: Without dead ends: 315729 [2018-12-08 12:27:46,496 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-08 12:27:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315729 states. [2018-12-08 12:27:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315729 to 259069. [2018-12-08 12:27:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259069 states. [2018-12-08 12:27:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259069 states to 259069 states and 1099300 transitions. [2018-12-08 12:27:52,319 INFO L78 Accepts]: Start accepts. Automaton has 259069 states and 1099300 transitions. Word has length 63 [2018-12-08 12:27:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:52,320 INFO L480 AbstractCegarLoop]: Abstraction has 259069 states and 1099300 transitions. [2018-12-08 12:27:52,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:27:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 259069 states and 1099300 transitions. [2018-12-08 12:27:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 12:27:52,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:52,357 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] [2018-12-08 12:27:52,357 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:52,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1318232314, now seen corresponding path program 1 times [2018-12-08 12:27:52,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:52,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:52,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:52,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:52,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:52,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:52,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:27:52,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:27:52,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:27:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:27:52,386 INFO L87 Difference]: Start difference. First operand 259069 states and 1099300 transitions. Second operand 5 states. [2018-12-08 12:27:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:52,614 INFO L93 Difference]: Finished difference Result 57901 states and 224524 transitions. [2018-12-08 12:27:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 12:27:52,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-08 12:27:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:52,716 INFO L225 Difference]: With dead ends: 57901 [2018-12-08 12:27:52,716 INFO L226 Difference]: Without dead ends: 50985 [2018-12-08 12:27:52,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:27:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50985 states. [2018-12-08 12:27:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50985 to 50745. [2018-12-08 12:27:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50745 states. [2018-12-08 12:27:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50745 states to 50745 states and 196311 transitions. [2018-12-08 12:27:55,656 INFO L78 Accepts]: Start accepts. Automaton has 50745 states and 196311 transitions. Word has length 63 [2018-12-08 12:27:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:55,657 INFO L480 AbstractCegarLoop]: Abstraction has 50745 states and 196311 transitions. [2018-12-08 12:27:55,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:27:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 50745 states and 196311 transitions. [2018-12-08 12:27:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 12:27:55,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:55,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:27:55,673 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:55,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2050602403, now seen corresponding path program 1 times [2018-12-08 12:27:55,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:55,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:55,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:55,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:55,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:27:55,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:27:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:27:55,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:27:55,705 INFO L87 Difference]: Start difference. First operand 50745 states and 196311 transitions. Second operand 4 states. [2018-12-08 12:27:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:55,962 INFO L93 Difference]: Finished difference Result 59864 states and 230930 transitions. [2018-12-08 12:27:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:27:55,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-08 12:27:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:56,078 INFO L225 Difference]: With dead ends: 59864 [2018-12-08 12:27:56,078 INFO L226 Difference]: Without dead ends: 59864 [2018-12-08 12:27:56,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:27:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59864 states. [2018-12-08 12:27:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59864 to 53960. [2018-12-08 12:27:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53960 states. [2018-12-08 12:27:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53960 states to 53960 states and 208378 transitions. [2018-12-08 12:27:56,861 INFO L78 Accepts]: Start accepts. Automaton has 53960 states and 208378 transitions. Word has length 73 [2018-12-08 12:27:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:56,862 INFO L480 AbstractCegarLoop]: Abstraction has 53960 states and 208378 transitions. [2018-12-08 12:27:56,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:27:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53960 states and 208378 transitions. [2018-12-08 12:27:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 12:27:56,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:56,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:27:56,881 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:56,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:56,881 INFO L82 PathProgramCache]: Analyzing trace with hash -307792068, now seen corresponding path program 1 times [2018-12-08 12:27:56,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:56,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:56,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:56,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:27:56,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:27:56,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:27:56,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:27:56,926 INFO L87 Difference]: Start difference. First operand 53960 states and 208378 transitions. Second operand 6 states. [2018-12-08 12:27:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:57,650 INFO L93 Difference]: Finished difference Result 98119 states and 377172 transitions. [2018-12-08 12:27:57,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 12:27:57,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-08 12:27:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:57,842 INFO L225 Difference]: With dead ends: 98119 [2018-12-08 12:27:57,842 INFO L226 Difference]: Without dead ends: 97799 [2018-12-08 12:27:57,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 12:27:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97799 states. [2018-12-08 12:27:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97799 to 58185. [2018-12-08 12:27:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58185 states. [2018-12-08 12:27:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58185 states to 58185 states and 223569 transitions. [2018-12-08 12:27:58,886 INFO L78 Accepts]: Start accepts. Automaton has 58185 states and 223569 transitions. Word has length 73 [2018-12-08 12:27:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:27:58,886 INFO L480 AbstractCegarLoop]: Abstraction has 58185 states and 223569 transitions. [2018-12-08 12:27:58,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:27:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 58185 states and 223569 transitions. [2018-12-08 12:27:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 12:27:58,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:27:58,909 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-08 12:27:58,909 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:27:58,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:27:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 757850877, now seen corresponding path program 1 times [2018-12-08 12:27:58,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:27:58,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:27:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:58,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:27:58,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:27:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:27:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:27:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:27:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:27:58,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:27:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:27:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:27:58,937 INFO L87 Difference]: Start difference. First operand 58185 states and 223569 transitions. Second operand 4 states. [2018-12-08 12:27:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:27:59,339 INFO L93 Difference]: Finished difference Result 84859 states and 319563 transitions. [2018-12-08 12:27:59,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:27:59,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-08 12:27:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:27:59,644 INFO L225 Difference]: With dead ends: 84859 [2018-12-08 12:27:59,645 INFO L226 Difference]: Without dead ends: 84571 [2018-12-08 12:27:59,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:27:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84571 states. [2018-12-08 12:28:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84571 to 66308. [2018-12-08 12:28:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66308 states. [2018-12-08 12:28:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66308 states to 66308 states and 251801 transitions. [2018-12-08 12:28:00,614 INFO L78 Accepts]: Start accepts. Automaton has 66308 states and 251801 transitions. Word has length 75 [2018-12-08 12:28:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:00,614 INFO L480 AbstractCegarLoop]: Abstraction has 66308 states and 251801 transitions. [2018-12-08 12:28:00,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:28:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 66308 states and 251801 transitions. [2018-12-08 12:28:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 12:28:00,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:00,646 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-08 12:28:00,646 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:00,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash 546499964, now seen corresponding path program 1 times [2018-12-08 12:28:00,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:00,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:00,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:00,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:00,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:00,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:00,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:28:00,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:28:00,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:28:00,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:28:00,687 INFO L87 Difference]: Start difference. First operand 66308 states and 251801 transitions. Second operand 4 states. [2018-12-08 12:28:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:01,080 INFO L93 Difference]: Finished difference Result 82714 states and 310868 transitions. [2018-12-08 12:28:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:28:01,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-08 12:28:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:01,232 INFO L225 Difference]: With dead ends: 82714 [2018-12-08 12:28:01,232 INFO L226 Difference]: Without dead ends: 82714 [2018-12-08 12:28:01,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:28:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82714 states. [2018-12-08 12:28:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82714 to 67563. [2018-12-08 12:28:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67563 states. [2018-12-08 12:28:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67563 states to 67563 states and 256323 transitions. [2018-12-08 12:28:02,311 INFO L78 Accepts]: Start accepts. Automaton has 67563 states and 256323 transitions. Word has length 75 [2018-12-08 12:28:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:02,312 INFO L480 AbstractCegarLoop]: Abstraction has 67563 states and 256323 transitions. [2018-12-08 12:28:02,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:28:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 67563 states and 256323 transitions. [2018-12-08 12:28:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 12:28:02,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:02,345 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-08 12:28:02,345 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:02,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1530709379, now seen corresponding path program 1 times [2018-12-08 12:28:02,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:02,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:02,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:02,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:28:02,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 12:28:02,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:28:02,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:28:02,372 INFO L87 Difference]: Start difference. First operand 67563 states and 256323 transitions. Second operand 3 states. [2018-12-08 12:28:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:02,684 INFO L93 Difference]: Finished difference Result 69551 states and 263181 transitions. [2018-12-08 12:28:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:28:02,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-08 12:28:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:02,813 INFO L225 Difference]: With dead ends: 69551 [2018-12-08 12:28:02,813 INFO L226 Difference]: Without dead ends: 69551 [2018-12-08 12:28:02,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:28:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69551 states. [2018-12-08 12:28:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69551 to 68557. [2018-12-08 12:28:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68557 states. [2018-12-08 12:28:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68557 states to 68557 states and 259623 transitions. [2018-12-08 12:28:03,817 INFO L78 Accepts]: Start accepts. Automaton has 68557 states and 259623 transitions. Word has length 75 [2018-12-08 12:28:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:03,818 INFO L480 AbstractCegarLoop]: Abstraction has 68557 states and 259623 transitions. [2018-12-08 12:28:03,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 12:28:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 68557 states and 259623 transitions. [2018-12-08 12:28:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:28:03,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:03,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] [2018-12-08 12:28:03,857 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:03,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 497950085, now seen corresponding path program 1 times [2018-12-08 12:28:03,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:03,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:03,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:03,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:28:03,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:28:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:28:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:28:03,900 INFO L87 Difference]: Start difference. First operand 68557 states and 259623 transitions. Second operand 6 states. [2018-12-08 12:28:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:04,601 INFO L93 Difference]: Finished difference Result 82777 states and 309410 transitions. [2018-12-08 12:28:04,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:28:04,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 12:28:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:04,753 INFO L225 Difference]: With dead ends: 82777 [2018-12-08 12:28:04,754 INFO L226 Difference]: Without dead ends: 82777 [2018-12-08 12:28:04,754 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-08 12:28:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82777 states. [2018-12-08 12:28:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82777 to 76865. [2018-12-08 12:28:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76865 states. [2018-12-08 12:28:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76865 states to 76865 states and 288763 transitions. [2018-12-08 12:28:06,021 INFO L78 Accepts]: Start accepts. Automaton has 76865 states and 288763 transitions. Word has length 77 [2018-12-08 12:28:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:06,022 INFO L480 AbstractCegarLoop]: Abstraction has 76865 states and 288763 transitions. [2018-12-08 12:28:06,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:28:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 76865 states and 288763 transitions. [2018-12-08 12:28:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:28:06,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:06,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:28:06,068 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:06,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1579259258, now seen corresponding path program 1 times [2018-12-08 12:28:06,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:06,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:06,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:28:06,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:28:06,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:28:06,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:28:06,125 INFO L87 Difference]: Start difference. First operand 76865 states and 288763 transitions. Second operand 6 states. [2018-12-08 12:28:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:06,574 INFO L93 Difference]: Finished difference Result 84458 states and 313444 transitions. [2018-12-08 12:28:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 12:28:06,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 12:28:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:06,729 INFO L225 Difference]: With dead ends: 84458 [2018-12-08 12:28:06,729 INFO L226 Difference]: Without dead ends: 84458 [2018-12-08 12:28:06,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 12:28:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84458 states. [2018-12-08 12:28:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84458 to 77293. [2018-12-08 12:28:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77293 states. [2018-12-08 12:28:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77293 states to 77293 states and 288534 transitions. [2018-12-08 12:28:08,062 INFO L78 Accepts]: Start accepts. Automaton has 77293 states and 288534 transitions. Word has length 77 [2018-12-08 12:28:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:08,063 INFO L480 AbstractCegarLoop]: Abstraction has 77293 states and 288534 transitions. [2018-12-08 12:28:08,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:28:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 77293 states and 288534 transitions. [2018-12-08 12:28:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:28:08,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:08,107 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-08 12:28:08,107 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:08,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:08,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1367908345, now seen corresponding path program 1 times [2018-12-08 12:28:08,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:08,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:08,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:08,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:08,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:08,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:08,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:28:08,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:28:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:28:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:28:08,146 INFO L87 Difference]: Start difference. First operand 77293 states and 288534 transitions. Second operand 5 states. [2018-12-08 12:28:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:08,598 INFO L93 Difference]: Finished difference Result 95533 states and 354425 transitions. [2018-12-08 12:28:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:28:08,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 12:28:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:08,774 INFO L225 Difference]: With dead ends: 95533 [2018-12-08 12:28:08,775 INFO L226 Difference]: Without dead ends: 95533 [2018-12-08 12:28:08,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:28:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95533 states. [2018-12-08 12:28:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95533 to 82171. [2018-12-08 12:28:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82171 states. [2018-12-08 12:28:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82171 states to 82171 states and 304547 transitions. [2018-12-08 12:28:09,977 INFO L78 Accepts]: Start accepts. Automaton has 82171 states and 304547 transitions. Word has length 77 [2018-12-08 12:28:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:09,978 INFO L480 AbstractCegarLoop]: Abstraction has 82171 states and 304547 transitions. [2018-12-08 12:28:09,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:28:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 82171 states and 304547 transitions. [2018-12-08 12:28:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:28:10,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:10,025 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-08 12:28:10,026 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:10,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1878442522, now seen corresponding path program 1 times [2018-12-08 12:28:10,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:10,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:10,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:10,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:28:10,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 12:28:10,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:28:10,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:28:10,067 INFO L87 Difference]: Start difference. First operand 82171 states and 304547 transitions. Second operand 5 states. [2018-12-08 12:28:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:10,785 INFO L93 Difference]: Finished difference Result 117948 states and 433789 transitions. [2018-12-08 12:28:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 12:28:10,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 12:28:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:11,011 INFO L225 Difference]: With dead ends: 117948 [2018-12-08 12:28:11,011 INFO L226 Difference]: Without dead ends: 117948 [2018-12-08 12:28:11,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:28:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117948 states. [2018-12-08 12:28:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117948 to 94014. [2018-12-08 12:28:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94014 states. [2018-12-08 12:28:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94014 states to 94014 states and 346727 transitions. [2018-12-08 12:28:12,509 INFO L78 Accepts]: Start accepts. Automaton has 94014 states and 346727 transitions. Word has length 77 [2018-12-08 12:28:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:12,509 INFO L480 AbstractCegarLoop]: Abstraction has 94014 states and 346727 transitions. [2018-12-08 12:28:12,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 12:28:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 94014 states and 346727 transitions. [2018-12-08 12:28:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:28:12,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:12,565 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-08 12:28:12,566 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:12,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:12,566 INFO L82 PathProgramCache]: Analyzing trace with hash 609070311, now seen corresponding path program 1 times [2018-12-08 12:28:12,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:12,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:12,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:12,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:12,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:12,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:28:12,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 12:28:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:28:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:28:12,606 INFO L87 Difference]: Start difference. First operand 94014 states and 346727 transitions. Second operand 4 states. [2018-12-08 12:28:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:13,400 INFO L93 Difference]: Finished difference Result 122526 states and 453159 transitions. [2018-12-08 12:28:13,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:28:13,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 12:28:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:13,641 INFO L225 Difference]: With dead ends: 122526 [2018-12-08 12:28:13,641 INFO L226 Difference]: Without dead ends: 120814 [2018-12-08 12:28:13,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:28:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120814 states. [2018-12-08 12:28:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120814 to 112058. [2018-12-08 12:28:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112058 states. [2018-12-08 12:28:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112058 states to 112058 states and 414607 transitions. [2018-12-08 12:28:15,671 INFO L78 Accepts]: Start accepts. Automaton has 112058 states and 414607 transitions. Word has length 77 [2018-12-08 12:28:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:15,672 INFO L480 AbstractCegarLoop]: Abstraction has 112058 states and 414607 transitions. [2018-12-08 12:28:15,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 12:28:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 112058 states and 414607 transitions. [2018-12-08 12:28:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:28:15,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:15,740 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-08 12:28:15,740 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:15,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:15,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1187881048, now seen corresponding path program 1 times [2018-12-08 12:28:15,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:15,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:15,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:15,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:15,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:15,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:15,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:28:15,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:28:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:28:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:28:15,802 INFO L87 Difference]: Start difference. First operand 112058 states and 414607 transitions. Second operand 7 states. [2018-12-08 12:28:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:16,381 INFO L93 Difference]: Finished difference Result 105992 states and 378733 transitions. [2018-12-08 12:28:16,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 12:28:16,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-08 12:28:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:16,578 INFO L225 Difference]: With dead ends: 105992 [2018-12-08 12:28:16,578 INFO L226 Difference]: Without dead ends: 105992 [2018-12-08 12:28:16,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-08 12:28:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105992 states. [2018-12-08 12:28:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105992 to 74108. [2018-12-08 12:28:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74108 states. [2018-12-08 12:28:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74108 states to 74108 states and 266226 transitions. [2018-12-08 12:28:17,750 INFO L78 Accepts]: Start accepts. Automaton has 74108 states and 266226 transitions. Word has length 77 [2018-12-08 12:28:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:17,750 INFO L480 AbstractCegarLoop]: Abstraction has 74108 states and 266226 transitions. [2018-12-08 12:28:17,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:28:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 74108 states and 266226 transitions. [2018-12-08 12:28:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 12:28:17,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:17,786 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-08 12:28:17,786 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:17,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash -300377367, now seen corresponding path program 1 times [2018-12-08 12:28:17,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:17,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:17,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:17,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:17,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:28:17,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:28:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:28:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:28:17,821 INFO L87 Difference]: Start difference. First operand 74108 states and 266226 transitions. Second operand 6 states. [2018-12-08 12:28:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:17,897 INFO L93 Difference]: Finished difference Result 22780 states and 72050 transitions. [2018-12-08 12:28:17,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:28:17,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 12:28:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:17,919 INFO L225 Difference]: With dead ends: 22780 [2018-12-08 12:28:17,919 INFO L226 Difference]: Without dead ends: 18630 [2018-12-08 12:28:17,919 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-08 12:28:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18630 states. [2018-12-08 12:28:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18630 to 16385. [2018-12-08 12:28:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16385 states. [2018-12-08 12:28:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16385 states to 16385 states and 51234 transitions. [2018-12-08 12:28:18,201 INFO L78 Accepts]: Start accepts. Automaton has 16385 states and 51234 transitions. Word has length 77 [2018-12-08 12:28:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:18,201 INFO L480 AbstractCegarLoop]: Abstraction has 16385 states and 51234 transitions. [2018-12-08 12:28:18,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:28:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 16385 states and 51234 transitions. [2018-12-08 12:28:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:28:18,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:18,214 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-08 12:28:18,214 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:18,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash -711257271, now seen corresponding path program 1 times [2018-12-08 12:28:18,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:18,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:18,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:18,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:18,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:18,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:18,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:28:18,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 12:28:18,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:28:18,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:28:18,302 INFO L87 Difference]: Start difference. First operand 16385 states and 51234 transitions. Second operand 6 states. [2018-12-08 12:28:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:18,431 INFO L93 Difference]: Finished difference Result 18930 states and 58520 transitions. [2018-12-08 12:28:18,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:28:18,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-08 12:28:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:18,451 INFO L225 Difference]: With dead ends: 18930 [2018-12-08 12:28:18,452 INFO L226 Difference]: Without dead ends: 18410 [2018-12-08 12:28:18,452 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-08 12:28:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18410 states. [2018-12-08 12:28:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18410 to 15475. [2018-12-08 12:28:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15475 states. [2018-12-08 12:28:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15475 states to 15475 states and 47761 transitions. [2018-12-08 12:28:18,624 INFO L78 Accepts]: Start accepts. Automaton has 15475 states and 47761 transitions. Word has length 94 [2018-12-08 12:28:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:18,625 INFO L480 AbstractCegarLoop]: Abstraction has 15475 states and 47761 transitions. [2018-12-08 12:28:18,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 12:28:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15475 states and 47761 transitions. [2018-12-08 12:28:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:28:18,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:18,638 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-08 12:28:18,638 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:18,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1506500682, now seen corresponding path program 1 times [2018-12-08 12:28:18,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:18,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:18,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:18,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:18,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 12:28:18,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 12:28:18,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 12:28:18,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 12:28:18,706 INFO L87 Difference]: Start difference. First operand 15475 states and 47761 transitions. Second operand 9 states. [2018-12-08 12:28:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:18,863 INFO L93 Difference]: Finished difference Result 26555 states and 81779 transitions. [2018-12-08 12:28:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 12:28:18,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-08 12:28:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:18,877 INFO L225 Difference]: With dead ends: 26555 [2018-12-08 12:28:18,877 INFO L226 Difference]: Without dead ends: 13935 [2018-12-08 12:28:18,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-08 12:28:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13935 states. [2018-12-08 12:28:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13935 to 13935. [2018-12-08 12:28:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13935 states. [2018-12-08 12:28:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13935 states to 13935 states and 42853 transitions. [2018-12-08 12:28:19,011 INFO L78 Accepts]: Start accepts. Automaton has 13935 states and 42853 transitions. Word has length 94 [2018-12-08 12:28:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:19,011 INFO L480 AbstractCegarLoop]: Abstraction has 13935 states and 42853 transitions. [2018-12-08 12:28:19,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 12:28:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13935 states and 42853 transitions. [2018-12-08 12:28:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:28:19,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:19,023 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-08 12:28:19,023 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:19,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash 873472454, now seen corresponding path program 2 times [2018-12-08 12:28:19,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:19,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:19,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:19,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:19,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:19,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 12:28:19,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 12:28:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 12:28:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 12:28:19,097 INFO L87 Difference]: Start difference. First operand 13935 states and 42853 transitions. Second operand 9 states. [2018-12-08 12:28:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:19,293 INFO L93 Difference]: Finished difference Result 36565 states and 112873 transitions. [2018-12-08 12:28:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 12:28:19,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-08 12:28:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:19,305 INFO L225 Difference]: With dead ends: 36565 [2018-12-08 12:28:19,305 INFO L226 Difference]: Without dead ends: 10342 [2018-12-08 12:28:19,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-12-08 12:28:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10342 states. [2018-12-08 12:28:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10342 to 10342. [2018-12-08 12:28:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10342 states. [2018-12-08 12:28:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 31692 transitions. [2018-12-08 12:28:19,399 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 31692 transitions. Word has length 94 [2018-12-08 12:28:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:19,399 INFO L480 AbstractCegarLoop]: Abstraction has 10342 states and 31692 transitions. [2018-12-08 12:28:19,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 12:28:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 31692 transitions. [2018-12-08 12:28:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:28:19,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:19,407 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-08 12:28:19,407 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:19,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 15963458, now seen corresponding path program 1 times [2018-12-08 12:28:19,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:19,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:19,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:28:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:19,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:19,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 12:28:19,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 12:28:19,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:28:19,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:28:19,472 INFO L87 Difference]: Start difference. First operand 10342 states and 31692 transitions. Second operand 7 states. [2018-12-08 12:28:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:19,678 INFO L93 Difference]: Finished difference Result 11745 states and 35760 transitions. [2018-12-08 12:28:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:28:19,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-08 12:28:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:19,690 INFO L225 Difference]: With dead ends: 11745 [2018-12-08 12:28:19,690 INFO L226 Difference]: Without dead ends: 11745 [2018-12-08 12:28:19,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:28:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11745 states. [2018-12-08 12:28:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11745 to 10116. [2018-12-08 12:28:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10116 states. [2018-12-08 12:28:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 31048 transitions. [2018-12-08 12:28:19,789 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 31048 transitions. Word has length 94 [2018-12-08 12:28:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:19,789 INFO L480 AbstractCegarLoop]: Abstraction has 10116 states and 31048 transitions. [2018-12-08 12:28:19,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 12:28:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 31048 transitions. [2018-12-08 12:28:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:28:19,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:19,797 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-08 12:28:19,797 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:19,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:19,797 INFO L82 PathProgramCache]: Analyzing trace with hash -761443295, now seen corresponding path program 1 times [2018-12-08 12:28:19,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:19,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:19,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:19,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:19,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:19,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 12:28:19,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 12:28:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:28:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:28:19,879 INFO L87 Difference]: Start difference. First operand 10116 states and 31048 transitions. Second operand 8 states. [2018-12-08 12:28:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:20,075 INFO L93 Difference]: Finished difference Result 12505 states and 38110 transitions. [2018-12-08 12:28:20,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 12:28:20,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-08 12:28:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:20,088 INFO L225 Difference]: With dead ends: 12505 [2018-12-08 12:28:20,088 INFO L226 Difference]: Without dead ends: 12409 [2018-12-08 12:28:20,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-08 12:28:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12409 states. [2018-12-08 12:28:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12409 to 10837. [2018-12-08 12:28:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10837 states. [2018-12-08 12:28:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10837 states to 10837 states and 33111 transitions. [2018-12-08 12:28:20,191 INFO L78 Accepts]: Start accepts. Automaton has 10837 states and 33111 transitions. Word has length 94 [2018-12-08 12:28:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:20,192 INFO L480 AbstractCegarLoop]: Abstraction has 10837 states and 33111 transitions. [2018-12-08 12:28:20,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 12:28:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 10837 states and 33111 transitions. [2018-12-08 12:28:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:28:20,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:20,200 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-08 12:28:20,200 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:20,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash 126060386, now seen corresponding path program 3 times [2018-12-08 12:28:20,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:20,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:20,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:20,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:28:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:28:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:28:20,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:28:20,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 12:28:20,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 12:28:20,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 12:28:20,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 12:28:20,287 INFO L87 Difference]: Start difference. First operand 10837 states and 33111 transitions. Second operand 11 states. [2018-12-08 12:28:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:28:20,889 INFO L93 Difference]: Finished difference Result 19085 states and 58409 transitions. [2018-12-08 12:28:20,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 12:28:20,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-08 12:28:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 12:28:20,901 INFO L225 Difference]: With dead ends: 19085 [2018-12-08 12:28:20,901 INFO L226 Difference]: Without dead ends: 12311 [2018-12-08 12:28:20,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-08 12:28:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12311 states. [2018-12-08 12:28:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12311 to 10951. [2018-12-08 12:28:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2018-12-08 12:28:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 33268 transitions. [2018-12-08 12:28:21,010 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 33268 transitions. Word has length 94 [2018-12-08 12:28:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 12:28:21,010 INFO L480 AbstractCegarLoop]: Abstraction has 10951 states and 33268 transitions. [2018-12-08 12:28:21,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 12:28:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 33268 transitions. [2018-12-08 12:28:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:28:21,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 12:28:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:28:21,020 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 12:28:21,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:28:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash -123561824, now seen corresponding path program 4 times [2018-12-08 12:28:21,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:28:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:28:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:21,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:28:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:28:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:28:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:28:21,056 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 12:28:21,134 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 12:28:21,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 12:28:21 BasicIcfg [2018-12-08 12:28:21,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 12:28:21,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:28:21,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:28:21,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:28:21,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:26:31" (3/4) ... [2018-12-08 12:28:21,138 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 12:28:21,211 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b21c3b6c-3bb1-4d70-968c-b48d5a6a0814/bin-2019/uautomizer/witness.graphml [2018-12-08 12:28:21,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:28:21,212 INFO L168 Benchmark]: Toolchain (without parser) took 110628.36 ms. Allocated memory was 1.0 GB in the beginning and 8.3 GB in the end (delta: 7.3 GB). Free memory was 956.0 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-08 12:28:21,213 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:28:21,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-08 12:28:21,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-08 12:28:21,213 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:28:21,214 INFO L168 Benchmark]: RCFGBuilder took 341.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-12-08 12:28:21,214 INFO L168 Benchmark]: TraceAbstraction took 109829.09 ms. Allocated memory was 1.2 GB in the beginning and 8.3 GB in the end (delta: 7.1 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-08 12:28:21,214 INFO L168 Benchmark]: Witness Printer took 76.15 ms. Allocated memory is still 8.3 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-08 12:28:21,215 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 341.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109829.09 ms. Allocated memory was 1.2 GB in the beginning and 8.3 GB in the end (delta: 7.1 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 76.15 ms. Allocated memory is still 8.3 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L694] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L695] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L696] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L697] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L698] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L699] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L700] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L701] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L702] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L703] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L704] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t924; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t924, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t925; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t925, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] -1 pthread_t t926; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK -1 pthread_create(&t926, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 0 y$w_buff1 = y$w_buff0 [L756] 0 y$w_buff0 = 1 [L757] 0 y$w_buff1_used = y$w_buff0_used [L758] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L761] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L762] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L763] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L764] 0 y$r_buff0_thd3 = (_Bool)1 [L767] 0 z = 1 [L770] 0 __unbuffered_p2_EAX = z [L773] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 a = 1 [L715] 1 __unbuffered_p0_EAX = x [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 x = 1 [L730] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 2 y$flush_delayed = weak$$choice2 [L733] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L780] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 y = y$flush_delayed ? y$mem_tmp : y [L743] 2 y$flush_delayed = (_Bool)0 [L748] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L812] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L813] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L816] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 220 locations, 3 error locations. UNSAFE Result, 109.7s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8362 SDtfs, 10765 SDslu, 19717 SDs, 0 SdLazy, 6165 SolverSat, 400 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259069occurred in iteration=9, 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: 58.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 645719 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2146 NumberOfCodeBlocks, 2146 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2024 ConstructedInterpolants, 0 QuantifiedInterpolants, 384419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...