./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/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 b75e5b8cdb5de0dc84c69b534dde09e58e02f350 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:45:53,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:45:53,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:45:53,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:45:53,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:45:53,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:45:53,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:45:53,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:45:53,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:45:53,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:45:53,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:45:53,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:45:53,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:45:53,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:45:53,343 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:45:53,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:45:53,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:45:53,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:45:53,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:45:53,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:45:53,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:45:53,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:45:53,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:45:53,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:45:53,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:45:53,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:45:53,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:45:53,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:45:53,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:45:53,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:45:53,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:45:53,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:45:53,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:45:53,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:45:53,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:45:53,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:45:53,358 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 10:45:53,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:45:53,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:45:53,368 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 10:45:53,368 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 10:45:53,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:45:53,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:45:53,369 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:45:53,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 10:45:53,370 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:45:53,371 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 10:45:53,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:45:53,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:45:53,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 10:45:53,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 10:45:53,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 10:45:53,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:45:53,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 10:45:53,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 10:45:53,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:45:53,372 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 10:45:53,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 10:45:53,372 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_114a0367-fb00-44ec-a380-5b04ec35723d/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 -> b75e5b8cdb5de0dc84c69b534dde09e58e02f350 [2018-12-08 10:45:53,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:45:53,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:45:53,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:45:53,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:45:53,403 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:45:53,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i [2018-12-08 10:45:53,439 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/data/389fb32b9/1b81741780fb4a26901fbf2267cc0f3e/FLAG5c36746f4 [2018-12-08 10:45:53,811 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:45:53,811 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/sv-benchmarks/c/pthread-wmm/rfi000_rmo.opt_false-unreach-call.i [2018-12-08 10:45:53,819 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/data/389fb32b9/1b81741780fb4a26901fbf2267cc0f3e/FLAG5c36746f4 [2018-12-08 10:45:54,175 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/data/389fb32b9/1b81741780fb4a26901fbf2267cc0f3e [2018-12-08 10:45:54,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:45:54,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 10:45:54,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:45:54,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:45:54,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:45:54,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5c87c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54, skipping insertion in model container [2018-12-08 10:45:54,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:45:54,213 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:45:54,390 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:45:54,398 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:45:54,471 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:45:54,502 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:45:54,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54 WrapperNode [2018-12-08 10:45:54,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:45:54,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 10:45:54,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 10:45:54,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 10:45:54,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 10:45:54,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:45:54,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:45:54,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:45:54,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... [2018-12-08 10:45:54,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:45:54,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:45:54,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:45:54,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:45:54,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/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 10:45:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:45:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:45:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 10:45:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:45:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 10:45:54,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 10:45:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 10:45:54,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 10:45:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 10:45:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:45:54,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:45:54,592 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 10:45:54,902 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:45:54,902 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 10:45:54,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:45:54 BoogieIcfgContainer [2018-12-08 10:45:54,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:45:54,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 10:45:54,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 10:45:54,905 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 10:45:54,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:45:54" (1/3) ... [2018-12-08 10:45:54,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daddf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:45:54, skipping insertion in model container [2018-12-08 10:45:54,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:45:54" (2/3) ... [2018-12-08 10:45:54,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1daddf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:45:54, skipping insertion in model container [2018-12-08 10:45:54,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:45:54" (3/3) ... [2018-12-08 10:45:54,908 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt_false-unreach-call.i [2018-12-08 10:45:54,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,930 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,930 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,931 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,935 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,935 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,936 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,936 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,936 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 10:45:54,943 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 10:45:54,943 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 10:45:54,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 10:45:54,960 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 10:45:54,974 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:45:54,974 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 10:45:54,974 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 10:45:54,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 10:45:54,974 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:45:54,974 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:45:54,975 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 10:45:54,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:45:54,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 10:45:54,981 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-08 10:45:56,026 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25088 states. [2018-12-08 10:45:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states. [2018-12-08 10:45:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 10:45:56,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:45:56,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:45:56,034 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:45:56,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:45:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1172530028, now seen corresponding path program 1 times [2018-12-08 10:45:56,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:45:56,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:45:56,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:56,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:45:56,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:45:56,174 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 10:45:56,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:45:56,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:45:56,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:45:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:45:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:45:56,188 INFO L87 Difference]: Start difference. First operand 25088 states. Second operand 4 states. [2018-12-08 10:45:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:45:56,554 INFO L93 Difference]: Finished difference Result 45388 states and 177626 transitions. [2018-12-08 10:45:56,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:45:56,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-08 10:45:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:45:56,695 INFO L225 Difference]: With dead ends: 45388 [2018-12-08 10:45:56,695 INFO L226 Difference]: Without dead ends: 40628 [2018-12-08 10:45:56,696 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 10:45:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2018-12-08 10:45:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 23662. [2018-12-08 10:45:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2018-12-08 10:45:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 92543 transitions. [2018-12-08 10:45:57,483 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 92543 transitions. Word has length 37 [2018-12-08 10:45:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:45:57,484 INFO L480 AbstractCegarLoop]: Abstraction has 23662 states and 92543 transitions. [2018-12-08 10:45:57,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:45:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 92543 transitions. [2018-12-08 10:45:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 10:45:57,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:45:57,486 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] [2018-12-08 10:45:57,487 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:45:57,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:45:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1746574175, now seen corresponding path program 1 times [2018-12-08 10:45:57,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:45:57,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:45:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:57,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:45:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:45:57,549 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 10:45:57,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:45:57,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:45:57,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:45:57,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:45:57,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:45:57,551 INFO L87 Difference]: Start difference. First operand 23662 states and 92543 transitions. Second operand 5 states. [2018-12-08 10:45:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:45:58,281 INFO L93 Difference]: Finished difference Result 64830 states and 241369 transitions. [2018-12-08 10:45:58,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:45:58,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-08 10:45:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:45:58,399 INFO L225 Difference]: With dead ends: 64830 [2018-12-08 10:45:58,399 INFO L226 Difference]: Without dead ends: 64670 [2018-12-08 10:45:58,400 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 10:45:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64670 states. [2018-12-08 10:45:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64670 to 37142. [2018-12-08 10:45:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37142 states. [2018-12-08 10:45:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 138284 transitions. [2018-12-08 10:45:59,226 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 138284 transitions. Word has length 44 [2018-12-08 10:45:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:45:59,227 INFO L480 AbstractCegarLoop]: Abstraction has 37142 states and 138284 transitions. [2018-12-08 10:45:59,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:45:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 138284 transitions. [2018-12-08 10:45:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 10:45:59,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:45:59,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:45:59,230 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:45:59,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:45:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1206649085, now seen corresponding path program 1 times [2018-12-08 10:45:59,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:45:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:45:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:59,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:45:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:45:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:45:59,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:45:59,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:45:59,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:45:59,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:45:59,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:45:59,268 INFO L87 Difference]: Start difference. First operand 37142 states and 138284 transitions. Second operand 4 states. [2018-12-08 10:45:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:45:59,315 INFO L93 Difference]: Finished difference Result 12364 states and 41177 transitions. [2018-12-08 10:45:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:45:59,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-08 10:45:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:45:59,332 INFO L225 Difference]: With dead ends: 12364 [2018-12-08 10:45:59,332 INFO L226 Difference]: Without dead ends: 11843 [2018-12-08 10:45:59,332 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 10:45:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2018-12-08 10:45:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11843. [2018-12-08 10:45:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2018-12-08 10:45:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 39622 transitions. [2018-12-08 10:45:59,483 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 39622 transitions. Word has length 45 [2018-12-08 10:45:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:45:59,484 INFO L480 AbstractCegarLoop]: Abstraction has 11843 states and 39622 transitions. [2018-12-08 10:45:59,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:45:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 39622 transitions. [2018-12-08 10:45:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 10:45:59,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:45:59,487 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 10:45:59,487 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:45:59,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:45:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1535092985, now seen corresponding path program 1 times [2018-12-08 10:45:59,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:45:59,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:45:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:59,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:45:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:45:59,543 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 10:45:59,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:45:59,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:45:59,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:45:59,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:45:59,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:45:59,544 INFO L87 Difference]: Start difference. First operand 11843 states and 39622 transitions. Second operand 4 states. [2018-12-08 10:45:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:45:59,709 INFO L93 Difference]: Finished difference Result 17019 states and 55693 transitions. [2018-12-08 10:45:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:45:59,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-08 10:45:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:45:59,731 INFO L225 Difference]: With dead ends: 17019 [2018-12-08 10:45:59,732 INFO L226 Difference]: Without dead ends: 17019 [2018-12-08 10:45:59,732 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 10:45:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2018-12-08 10:45:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 12879. [2018-12-08 10:45:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12879 states. [2018-12-08 10:45:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 42720 transitions. [2018-12-08 10:45:59,925 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 42720 transitions. Word has length 58 [2018-12-08 10:45:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:45:59,925 INFO L480 AbstractCegarLoop]: Abstraction has 12879 states and 42720 transitions. [2018-12-08 10:45:59,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:45:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 42720 transitions. [2018-12-08 10:45:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 10:45:59,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:45:59,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:45:59,930 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:45:59,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:45:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash -986044169, now seen corresponding path program 1 times [2018-12-08 10:45:59,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:45:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:45:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:59,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:45:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:45:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:45:59,996 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 10:45:59,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:45:59,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:45:59,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:45:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:45:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:45:59,998 INFO L87 Difference]: Start difference. First operand 12879 states and 42720 transitions. Second operand 6 states. [2018-12-08 10:46:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:00,376 INFO L93 Difference]: Finished difference Result 18599 states and 60830 transitions. [2018-12-08 10:46:00,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:46:00,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-08 10:46:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:00,468 INFO L225 Difference]: With dead ends: 18599 [2018-12-08 10:46:00,468 INFO L226 Difference]: Without dead ends: 18567 [2018-12-08 10:46:00,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 10:46:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2018-12-08 10:46:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 14411. [2018-12-08 10:46:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2018-12-08 10:46:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 47549 transitions. [2018-12-08 10:46:00,630 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 47549 transitions. Word has length 58 [2018-12-08 10:46:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:00,630 INFO L480 AbstractCegarLoop]: Abstraction has 14411 states and 47549 transitions. [2018-12-08 10:46:00,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:46:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 47549 transitions. [2018-12-08 10:46:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 10:46:00,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:00,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:00,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:00,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2012561834, now seen corresponding path program 1 times [2018-12-08 10:46:00,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:00,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:00,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:00,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:46:00,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:00,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:46:00,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:46:00,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:46:00,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:46:00,683 INFO L87 Difference]: Start difference. First operand 14411 states and 47549 transitions. Second operand 4 states. [2018-12-08 10:46:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:00,982 INFO L93 Difference]: Finished difference Result 23159 states and 75002 transitions. [2018-12-08 10:46:00,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:46:00,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-08 10:46:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:01,009 INFO L225 Difference]: With dead ends: 23159 [2018-12-08 10:46:01,009 INFO L226 Difference]: Without dead ends: 22983 [2018-12-08 10:46:01,009 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 10:46:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22983 states. [2018-12-08 10:46:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22983 to 19511. [2018-12-08 10:46:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19511 states. [2018-12-08 10:46:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19511 states to 19511 states and 63974 transitions. [2018-12-08 10:46:01,245 INFO L78 Accepts]: Start accepts. Automaton has 19511 states and 63974 transitions. Word has length 72 [2018-12-08 10:46:01,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:01,245 INFO L480 AbstractCegarLoop]: Abstraction has 19511 states and 63974 transitions. [2018-12-08 10:46:01,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:46:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 19511 states and 63974 transitions. [2018-12-08 10:46:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 10:46:01,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:01,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:01,257 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:01,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash -659252137, now seen corresponding path program 1 times [2018-12-08 10:46:01,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:01,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:01,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:01,314 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 10:46:01,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:01,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:46:01,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:46:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:46:01,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:46:01,315 INFO L87 Difference]: Start difference. First operand 19511 states and 63974 transitions. Second operand 4 states. [2018-12-08 10:46:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:01,857 INFO L93 Difference]: Finished difference Result 27542 states and 88892 transitions. [2018-12-08 10:46:01,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:46:01,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-08 10:46:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:01,897 INFO L225 Difference]: With dead ends: 27542 [2018-12-08 10:46:01,897 INFO L226 Difference]: Without dead ends: 27542 [2018-12-08 10:46:01,897 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 10:46:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27542 states. [2018-12-08 10:46:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27542 to 24767. [2018-12-08 10:46:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24767 states. [2018-12-08 10:46:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24767 states to 24767 states and 80580 transitions. [2018-12-08 10:46:02,253 INFO L78 Accepts]: Start accepts. Automaton has 24767 states and 80580 transitions. Word has length 72 [2018-12-08 10:46:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:02,253 INFO L480 AbstractCegarLoop]: Abstraction has 24767 states and 80580 transitions. [2018-12-08 10:46:02,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:46:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 24767 states and 80580 transitions. [2018-12-08 10:46:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 10:46:02,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:02,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:02,269 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:02,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash -594348726, now seen corresponding path program 1 times [2018-12-08 10:46:02,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:02,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46: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 10:46:02,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:02,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:46:02,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:46:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:46:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:46:02,372 INFO L87 Difference]: Start difference. First operand 24767 states and 80580 transitions. Second operand 8 states. [2018-12-08 10:46:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:03,439 INFO L93 Difference]: Finished difference Result 37721 states and 118603 transitions. [2018-12-08 10:46:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:46:03,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-08 10:46:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:03,487 INFO L225 Difference]: With dead ends: 37721 [2018-12-08 10:46:03,487 INFO L226 Difference]: Without dead ends: 37473 [2018-12-08 10:46:03,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:46:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37473 states. [2018-12-08 10:46:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37473 to 27364. [2018-12-08 10:46:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27364 states. [2018-12-08 10:46:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27364 states to 27364 states and 88368 transitions. [2018-12-08 10:46:03,861 INFO L78 Accepts]: Start accepts. Automaton has 27364 states and 88368 transitions. Word has length 72 [2018-12-08 10:46:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:03,861 INFO L480 AbstractCegarLoop]: Abstraction has 27364 states and 88368 transitions. [2018-12-08 10:46:03,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:46:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27364 states and 88368 transitions. [2018-12-08 10:46:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 10:46:03,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:03,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:03,881 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:03,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash -887751733, now seen corresponding path program 1 times [2018-12-08 10:46:03,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:03,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:03,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:03,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:03,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:03,974 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 10:46:03,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:03,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:46:03,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:46:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:46:03,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:46:03,975 INFO L87 Difference]: Start difference. First operand 27364 states and 88368 transitions. Second operand 6 states. [2018-12-08 10:46:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:04,261 INFO L93 Difference]: Finished difference Result 29954 states and 95614 transitions. [2018-12-08 10:46:04,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:46:04,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-08 10:46:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:04,304 INFO L225 Difference]: With dead ends: 29954 [2018-12-08 10:46:04,304 INFO L226 Difference]: Without dead ends: 29954 [2018-12-08 10:46:04,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:46:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29954 states. [2018-12-08 10:46:04,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29954 to 28147. [2018-12-08 10:46:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28147 states. [2018-12-08 10:46:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28147 states to 28147 states and 90561 transitions. [2018-12-08 10:46:04,683 INFO L78 Accepts]: Start accepts. Automaton has 28147 states and 90561 transitions. Word has length 72 [2018-12-08 10:46:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:04,683 INFO L480 AbstractCegarLoop]: Abstraction has 28147 states and 90561 transitions. [2018-12-08 10:46:04,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:46:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 28147 states and 90561 transitions. [2018-12-08 10:46:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 10:46:04,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:04,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:04,704 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:04,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash 73862284, now seen corresponding path program 1 times [2018-12-08 10:46:04,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:04,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:04,756 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 10:46:04,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:04,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:46:04,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:46:04,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:46:04,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:46:04,757 INFO L87 Difference]: Start difference. First operand 28147 states and 90561 transitions. Second operand 5 states. [2018-12-08 10:46:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:04,802 INFO L93 Difference]: Finished difference Result 4691 states and 12177 transitions. [2018-12-08 10:46:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:46:04,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-08 10:46:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:04,808 INFO L225 Difference]: With dead ends: 4691 [2018-12-08 10:46:04,808 INFO L226 Difference]: Without dead ends: 3893 [2018-12-08 10:46:04,808 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 10:46:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2018-12-08 10:46:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3596. [2018-12-08 10:46:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3596 states. [2018-12-08 10:46:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 9379 transitions. [2018-12-08 10:46:04,907 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 9379 transitions. Word has length 72 [2018-12-08 10:46:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:04,907 INFO L480 AbstractCegarLoop]: Abstraction has 3596 states and 9379 transitions. [2018-12-08 10:46:04,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:46:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 9379 transitions. [2018-12-08 10:46:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 10:46:04,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:04,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:04,910 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:04,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1359573718, now seen corresponding path program 1 times [2018-12-08 10:46:04,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:04,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:04,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:04,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:04,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:04,951 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 10:46:04,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:04,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:46:04,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:46:04,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:46:04,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:46:04,952 INFO L87 Difference]: Start difference. First operand 3596 states and 9379 transitions. Second operand 5 states. [2018-12-08 10:46:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:05,067 INFO L93 Difference]: Finished difference Result 3926 states and 10118 transitions. [2018-12-08 10:46:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:46:05,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 10:46:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:05,071 INFO L225 Difference]: With dead ends: 3926 [2018-12-08 10:46:05,071 INFO L226 Difference]: Without dead ends: 3926 [2018-12-08 10:46:05,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:46:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2018-12-08 10:46:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3634. [2018-12-08 10:46:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-12-08 10:46:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 9483 transitions. [2018-12-08 10:46:05,109 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 9483 transitions. Word has length 91 [2018-12-08 10:46:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:05,109 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 9483 transitions. [2018-12-08 10:46:05,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:46:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 9483 transitions. [2018-12-08 10:46:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 10:46:05,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:05,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:05,113 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:05,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1671596477, now seen corresponding path program 1 times [2018-12-08 10:46:05,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:05,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:05,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:05,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:05,164 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 10:46:05,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:05,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:46:05,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:46:05,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:46:05,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:46:05,165 INFO L87 Difference]: Start difference. First operand 3634 states and 9483 transitions. Second operand 4 states. [2018-12-08 10:46:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:05,258 INFO L93 Difference]: Finished difference Result 4252 states and 10932 transitions. [2018-12-08 10:46:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:46:05,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-08 10:46:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:05,262 INFO L225 Difference]: With dead ends: 4252 [2018-12-08 10:46:05,262 INFO L226 Difference]: Without dead ends: 4224 [2018-12-08 10:46:05,262 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 10:46:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4224 states. [2018-12-08 10:46:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4224 to 4156. [2018-12-08 10:46:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4156 states. [2018-12-08 10:46:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 10728 transitions. [2018-12-08 10:46:05,296 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 10728 transitions. Word has length 91 [2018-12-08 10:46:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:05,297 INFO L480 AbstractCegarLoop]: Abstraction has 4156 states and 10728 transitions. [2018-12-08 10:46:05,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:46:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 10728 transitions. [2018-12-08 10:46:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 10:46:05,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:05,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:05,300 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:05,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash -702015454, now seen corresponding path program 1 times [2018-12-08 10:46:05,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:05,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:05,324 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 10:46:05,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:05,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:46:05,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:46:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:46:05,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:46:05,325 INFO L87 Difference]: Start difference. First operand 4156 states and 10728 transitions. Second operand 4 states. [2018-12-08 10:46:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:05,471 INFO L93 Difference]: Finished difference Result 5141 states and 13366 transitions. [2018-12-08 10:46:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:46:05,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-08 10:46:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:05,477 INFO L225 Difference]: With dead ends: 5141 [2018-12-08 10:46:05,477 INFO L226 Difference]: Without dead ends: 5141 [2018-12-08 10:46:05,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:46:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2018-12-08 10:46:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4021. [2018-12-08 10:46:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2018-12-08 10:46:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 10331 transitions. [2018-12-08 10:46:05,522 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 10331 transitions. Word has length 91 [2018-12-08 10:46:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:05,522 INFO L480 AbstractCegarLoop]: Abstraction has 4021 states and 10331 transitions. [2018-12-08 10:46:05,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:46:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 10331 transitions. [2018-12-08 10:46:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 10:46:05,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:05,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:05,526 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:05,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1437858380, now seen corresponding path program 2 times [2018-12-08 10:46:05,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:05,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:46:05,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:05,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:46:05,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:46:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:46:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:46:05,576 INFO L87 Difference]: Start difference. First operand 4021 states and 10331 transitions. Second operand 5 states. [2018-12-08 10:46:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:05,707 INFO L93 Difference]: Finished difference Result 4493 states and 11451 transitions. [2018-12-08 10:46:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:46:05,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-08 10:46:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:05,711 INFO L225 Difference]: With dead ends: 4493 [2018-12-08 10:46:05,711 INFO L226 Difference]: Without dead ends: 4465 [2018-12-08 10:46:05,711 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 10:46:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-12-08 10:46:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3983. [2018-12-08 10:46:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2018-12-08 10:46:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 10225 transitions. [2018-12-08 10:46:05,747 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 10225 transitions. Word has length 91 [2018-12-08 10:46:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:05,747 INFO L480 AbstractCegarLoop]: Abstraction has 3983 states and 10225 transitions. [2018-12-08 10:46:05,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:46:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 10225 transitions. [2018-12-08 10:46:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 10:46:05,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:05,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:05,751 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:05,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1748261029, now seen corresponding path program 1 times [2018-12-08 10:46:05,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:05,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:46:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:05,808 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 10:46:05,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:05,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:46:05,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:46:05,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:46:05,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:46:05,809 INFO L87 Difference]: Start difference. First operand 3983 states and 10225 transitions. Second operand 7 states. [2018-12-08 10:46:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:05,991 INFO L93 Difference]: Finished difference Result 4442 states and 11301 transitions. [2018-12-08 10:46:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:46:05,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-08 10:46:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:05,995 INFO L225 Difference]: With dead ends: 4442 [2018-12-08 10:46:05,995 INFO L226 Difference]: Without dead ends: 4442 [2018-12-08 10:46:05,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 10:46:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2018-12-08 10:46:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4089. [2018-12-08 10:46:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4089 states. [2018-12-08 10:46:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 10439 transitions. [2018-12-08 10:46:06,029 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 10439 transitions. Word has length 93 [2018-12-08 10:46:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:06,029 INFO L480 AbstractCegarLoop]: Abstraction has 4089 states and 10439 transitions. [2018-12-08 10:46:06,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:46:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 10439 transitions. [2018-12-08 10:46:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 10:46:06,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:06,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:06,032 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:06,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash 564913732, now seen corresponding path program 1 times [2018-12-08 10:46:06,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:06,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:06,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 10:46:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:46:06,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:46:06,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:46:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:46:06,098 INFO L87 Difference]: Start difference. First operand 4089 states and 10439 transitions. Second operand 5 states. [2018-12-08 10:46:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:06,166 INFO L93 Difference]: Finished difference Result 3548 states and 9033 transitions. [2018-12-08 10:46:06,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:46:06,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-08 10:46:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:06,169 INFO L225 Difference]: With dead ends: 3548 [2018-12-08 10:46:06,169 INFO L226 Difference]: Without dead ends: 3548 [2018-12-08 10:46:06,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:46:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-12-08 10:46:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3448. [2018-12-08 10:46:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3448 states. [2018-12-08 10:46:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 8827 transitions. [2018-12-08 10:46:06,196 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 8827 transitions. Word has length 93 [2018-12-08 10:46:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:06,196 INFO L480 AbstractCegarLoop]: Abstraction has 3448 states and 8827 transitions. [2018-12-08 10:46:06,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:46:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 8827 transitions. [2018-12-08 10:46:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 10:46:06,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:06,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] [2018-12-08 10:46:06,200 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:06,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:06,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1370746555, now seen corresponding path program 1 times [2018-12-08 10:46:06,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:06,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:06,280 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 10:46:06,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:46:06,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:46:06,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:46:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:46:06,281 INFO L87 Difference]: Start difference. First operand 3448 states and 8827 transitions. Second operand 6 states. [2018-12-08 10:46:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:06,380 INFO L93 Difference]: Finished difference Result 3208 states and 8051 transitions. [2018-12-08 10:46:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:46:06,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-08 10:46:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:06,383 INFO L225 Difference]: With dead ends: 3208 [2018-12-08 10:46:06,383 INFO L226 Difference]: Without dead ends: 3208 [2018-12-08 10:46:06,383 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 10:46:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2018-12-08 10:46:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2802. [2018-12-08 10:46:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-12-08 10:46:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 7089 transitions. [2018-12-08 10:46:06,404 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 7089 transitions. Word has length 93 [2018-12-08 10:46:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:06,404 INFO L480 AbstractCegarLoop]: Abstraction has 2802 states and 7089 transitions. [2018-12-08 10:46:06,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:46:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 7089 transitions. [2018-12-08 10:46:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:46:06,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:06,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:06,406 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:06,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1440363890, now seen corresponding path program 1 times [2018-12-08 10:46:06,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:06,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:06,445 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 10:46:06,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:06,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:46:06,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:46:06,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:46:06,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:46:06,446 INFO L87 Difference]: Start difference. First operand 2802 states and 7089 transitions. Second operand 7 states. [2018-12-08 10:46:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:06,708 INFO L93 Difference]: Finished difference Result 4442 states and 10970 transitions. [2018-12-08 10:46:06,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 10:46:06,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-08 10:46:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:06,711 INFO L225 Difference]: With dead ends: 4442 [2018-12-08 10:46:06,711 INFO L226 Difference]: Without dead ends: 4442 [2018-12-08 10:46:06,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 10:46:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2018-12-08 10:46:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 3168. [2018-12-08 10:46:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2018-12-08 10:46:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7977 transitions. [2018-12-08 10:46:06,736 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7977 transitions. Word has length 95 [2018-12-08 10:46:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:06,736 INFO L480 AbstractCegarLoop]: Abstraction has 3168 states and 7977 transitions. [2018-12-08 10:46:06,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:46:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7977 transitions. [2018-12-08 10:46:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:46:06,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:06,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:06,739 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:06,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash -195599409, now seen corresponding path program 1 times [2018-12-08 10:46:06,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:06,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:06,802 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 10:46:06,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:06,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:46:06,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:46:06,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:46:06,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:46:06,803 INFO L87 Difference]: Start difference. First operand 3168 states and 7977 transitions. Second operand 6 states. [2018-12-08 10:46:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:06,941 INFO L93 Difference]: Finished difference Result 3361 states and 8390 transitions. [2018-12-08 10:46:06,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:46:06,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-08 10:46:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:06,944 INFO L225 Difference]: With dead ends: 3361 [2018-12-08 10:46:06,944 INFO L226 Difference]: Without dead ends: 3361 [2018-12-08 10:46:06,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:46:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2018-12-08 10:46:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3247. [2018-12-08 10:46:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3247 states. [2018-12-08 10:46:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 8155 transitions. [2018-12-08 10:46:06,967 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 8155 transitions. Word has length 95 [2018-12-08 10:46:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:06,967 INFO L480 AbstractCegarLoop]: Abstraction has 3247 states and 8155 transitions. [2018-12-08 10:46:06,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:46:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 8155 transitions. [2018-12-08 10:46:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:46:06,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:06,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:06,970 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:06,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:06,970 INFO L82 PathProgramCache]: Analyzing trace with hash 192440109, now seen corresponding path program 1 times [2018-12-08 10:46:06,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:06,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:06,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:06,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:07,022 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 10:46:07,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:07,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:46:07,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:46:07,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:46:07,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:46:07,023 INFO L87 Difference]: Start difference. First operand 3247 states and 8155 transitions. Second operand 6 states. [2018-12-08 10:46:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:07,093 INFO L93 Difference]: Finished difference Result 3329 states and 8264 transitions. [2018-12-08 10:46:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:46:07,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-08 10:46:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:07,096 INFO L225 Difference]: With dead ends: 3329 [2018-12-08 10:46:07,096 INFO L226 Difference]: Without dead ends: 3329 [2018-12-08 10:46:07,097 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 10:46:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-12-08 10:46:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3205. [2018-12-08 10:46:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2018-12-08 10:46:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 8031 transitions. [2018-12-08 10:46:07,121 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 8031 transitions. Word has length 95 [2018-12-08 10:46:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:07,121 INFO L480 AbstractCegarLoop]: Abstraction has 3205 states and 8031 transitions. [2018-12-08 10:46:07,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:46:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 8031 transitions. [2018-12-08 10:46:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:46:07,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:07,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:07,124 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:07,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:07,124 INFO L82 PathProgramCache]: Analyzing trace with hash 316513356, now seen corresponding path program 1 times [2018-12-08 10:46:07,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:07,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:07,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:07,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:07,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:46:07,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:07,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:46:07,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:46:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:46:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:46:07,201 INFO L87 Difference]: Start difference. First operand 3205 states and 8031 transitions. Second operand 8 states. [2018-12-08 10:46:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:07,508 INFO L93 Difference]: Finished difference Result 4813 states and 12224 transitions. [2018-12-08 10:46:07,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 10:46:07,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-08 10:46:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:07,512 INFO L225 Difference]: With dead ends: 4813 [2018-12-08 10:46:07,512 INFO L226 Difference]: Without dead ends: 4781 [2018-12-08 10:46:07,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-08 10:46:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2018-12-08 10:46:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4616. [2018-12-08 10:46:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4616 states. [2018-12-08 10:46:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 11735 transitions. [2018-12-08 10:46:07,548 INFO L78 Accepts]: Start accepts. Automaton has 4616 states and 11735 transitions. Word has length 95 [2018-12-08 10:46:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:07,548 INFO L480 AbstractCegarLoop]: Abstraction has 4616 states and 11735 transitions. [2018-12-08 10:46:07,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:46:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4616 states and 11735 transitions. [2018-12-08 10:46:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:46:07,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:07,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:07,552 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:07,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1561277837, now seen corresponding path program 1 times [2018-12-08 10:46:07,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:07,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:07,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:07,621 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 10:46:07,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:07,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:46:07,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:46:07,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:46:07,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:46:07,622 INFO L87 Difference]: Start difference. First operand 4616 states and 11735 transitions. Second operand 7 states. [2018-12-08 10:46:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:07,773 INFO L93 Difference]: Finished difference Result 7255 states and 18752 transitions. [2018-12-08 10:46:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:46:07,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-08 10:46:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:07,776 INFO L225 Difference]: With dead ends: 7255 [2018-12-08 10:46:07,776 INFO L226 Difference]: Without dead ends: 2720 [2018-12-08 10:46:07,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:46:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-12-08 10:46:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2720. [2018-12-08 10:46:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2018-12-08 10:46:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 7157 transitions. [2018-12-08 10:46:07,795 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 7157 transitions. Word has length 95 [2018-12-08 10:46:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:07,795 INFO L480 AbstractCegarLoop]: Abstraction has 2720 states and 7157 transitions. [2018-12-08 10:46:07,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:46:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 7157 transitions. [2018-12-08 10:46:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:46:07,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:07,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, 1] [2018-12-08 10:46:07,798 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:07,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash -827369038, now seen corresponding path program 1 times [2018-12-08 10:46:07,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:07,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:07,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:07,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:07,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:46:07,875 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 10:46:07,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:46:07,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:46:07,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:46:07,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:46:07,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:46:07,876 INFO L87 Difference]: Start difference. First operand 2720 states and 7157 transitions. Second operand 7 states. [2018-12-08 10:46:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:46:08,040 INFO L93 Difference]: Finished difference Result 2798 states and 7294 transitions. [2018-12-08 10:46:08,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:46:08,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-08 10:46:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:46:08,043 INFO L225 Difference]: With dead ends: 2798 [2018-12-08 10:46:08,043 INFO L226 Difference]: Without dead ends: 2769 [2018-12-08 10:46:08,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:46:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2018-12-08 10:46:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2745. [2018-12-08 10:46:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2745 states. [2018-12-08 10:46:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 7205 transitions. [2018-12-08 10:46:08,063 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 7205 transitions. Word has length 95 [2018-12-08 10:46:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:46:08,064 INFO L480 AbstractCegarLoop]: Abstraction has 2745 states and 7205 transitions. [2018-12-08 10:46:08,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:46:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 7205 transitions. [2018-12-08 10:46:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:46:08,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:46:08,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:46:08,066 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 10:46:08,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:46:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2010716335, now seen corresponding path program 2 times [2018-12-08 10:46:08,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:46:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:46:08,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:08,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:46:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:46:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:46:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 10:46:08,131 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 10:46:08,196 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 10:46:08,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:46:08 BasicIcfg [2018-12-08 10:46:08,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 10:46:08,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:46:08,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:46:08,198 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:46:08,198 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:45:54" (3/4) ... [2018-12-08 10:46:08,200 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 10:46:08,266 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_114a0367-fb00-44ec-a380-5b04ec35723d/bin-2019/uautomizer/witness.graphml [2018-12-08 10:46:08,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:46:08,267 INFO L168 Benchmark]: Toolchain (without parser) took 14089.74 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 950.6 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 349.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:46:08,267 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:46:08,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-08 10:46:08,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-08 10:46:08,268 INFO L168 Benchmark]: Boogie Preprocessor took 20.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:46:08,268 INFO L168 Benchmark]: RCFGBuilder took 344.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-08 10:46:08,269 INFO L168 Benchmark]: TraceAbstraction took 13294.22 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 280.3 MB. Max. memory is 11.5 GB. [2018-12-08 10:46:08,269 INFO L168 Benchmark]: Witness Printer took 68.34 ms. Allocated memory is still 2.8 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-08 10:46:08,271 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13294.22 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 280.3 MB. Max. memory is 11.5 GB. * Witness Printer took 68.34 ms. Allocated memory is still 2.8 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] -1 pthread_t t1597; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] FCALL, FORK -1 pthread_create(&t1597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] -1 pthread_t t1598; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] FCALL, FORK -1 pthread_create(&t1598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 y = 1 [L735] 0 __unbuffered_p1_EAX = y [L738] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L701] 1 y = 2 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L742] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L748] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L773] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L779] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L780] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L781] -1 x$flush_delayed = weak$$choice2 [L782] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L784] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L785] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L786] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L788] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L789] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] -1 x = x$flush_delayed ? x$mem_tmp : x [L792] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 180 locations, 3 error locations. UNSAFE Result, 13.2s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5517 SDtfs, 4855 SDslu, 11759 SDs, 0 SdLazy, 5984 SolverSat, 320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37142occurred in iteration=2, 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: 3.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 75772 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1910 NumberOfCodeBlocks, 1910 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 380149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...