./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/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 1e70765932d5ecd399058d3d0c5f33de11a7a07e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0cd3be1 [2018-11-28 12:31:37,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:31:37,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:31:37,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:31:37,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:31:37,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:31:37,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:31:37,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:31:37,973 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:31:37,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:31:37,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:31:37,975 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:31:37,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:31:37,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:31:37,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:31:37,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:31:37,978 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:31:37,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:31:37,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:31:37,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:31:37,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:31:37,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:31:37,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:31:37,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:31:37,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:31:37,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:31:37,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:31:37,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:31:37,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:31:37,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:31:37,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:31:37,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:31:37,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:31:37,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:31:37,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:31:37,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:31:37,989 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:31:37,996 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:31:37,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:31:37,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:31:37,997 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:31:37,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:31:37,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:31:37,998 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:31:37,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:31:37,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:31:37,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:31:37,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:31:37,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:31:37,999 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:31:37,999 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:31:37,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:31:38,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:31:38,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:31:38,000 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:31:38,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:31:38,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:31:38,000 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:31:38,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:31:38,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:31:38,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:31:38,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:31:38,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:31:38,001 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:31:38,001 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:31:38,002 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:31:38,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:31:38,002 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_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/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 -> 1e70765932d5ecd399058d3d0c5f33de11a7a07e [2018-11-28 12:31:38,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:31:38,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:31:38,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:31:38,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:31:38,039 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:31:38,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i [2018-11-28 12:31:38,084 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/data/3e42123c5/98412b8db3e548518e38fecdf11ce636/FLAG6db6ba2f7 [2018-11-28 12:31:38,523 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:31:38,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i [2018-11-28 12:31:38,533 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/data/3e42123c5/98412b8db3e548518e38fecdf11ce636/FLAG6db6ba2f7 [2018-11-28 12:31:38,543 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/data/3e42123c5/98412b8db3e548518e38fecdf11ce636 [2018-11-28 12:31:38,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:31:38,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:31:38,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:31:38,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:31:38,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:31:38,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3592b053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38, skipping insertion in model container [2018-11-28 12:31:38,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:31:38,586 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:31:38,798 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:31:38,810 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:31:38,890 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:31:38,929 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:31:38,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38 WrapperNode [2018-11-28 12:31:38,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:31:38,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:31:38,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:31:38,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:31:38,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:31:38,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:31:38,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:31:38,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:31:38,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:38,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... [2018-11-28 12:31:39,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:31:39,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:31:39,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:31:39,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:31:39,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/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-11-28 12:31:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:31:39,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:31:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 12:31:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:31:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 12:31:39,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 12:31:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 12:31:39,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 12:31:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 12:31:39,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 12:31:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 12:31:39,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:31:39,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:31:39,048 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 12:31:39,574 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:31:39,575 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:31:39,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:31:39 BoogieIcfgContainer [2018-11-28 12:31:39,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:31:39,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:31:39,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:31:39,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:31:39,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:31:38" (1/3) ... [2018-11-28 12:31:39,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32efb781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:31:39, skipping insertion in model container [2018-11-28 12:31:39,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:31:38" (2/3) ... [2018-11-28 12:31:39,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32efb781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:31:39, skipping insertion in model container [2018-11-28 12:31:39,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:31:39" (3/3) ... [2018-11-28 12:31:39,579 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt_false-unreach-call.i [2018-11-28 12:31:39,609 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,609 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,610 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,610 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,610 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,610 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,610 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,610 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,611 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,611 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,611 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,611 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,611 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,613 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,614 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,616 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,616 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,616 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,616 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,616 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,616 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,620 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,620 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,620 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,620 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,621 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,621 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,621 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:31:39,643 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 12:31:39,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:31:39,650 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 12:31:39,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 12:31:39,683 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:31:39,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:31:39,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:31:39,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:31:39,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:31:39,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:31:39,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:31:39,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:31:39,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:31:39,695 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-11-28 12:31:54,874 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-11-28 12:31:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-11-28 12:31:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 12:31:54,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:31:54,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:31:54,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:31:54,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:31:54,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-11-28 12:31:54,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:31:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:31:54,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:54,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:31:54,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:31:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:31:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:31:55,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:31:55,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:31:55,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:31:55,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:31:55,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:31:55,102 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-11-28 12:31:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:31:56,454 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-11-28 12:31:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:31:56,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-28 12:31:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:00,256 INFO L225 Difference]: With dead ends: 233475 [2018-11-28 12:32:00,256 INFO L226 Difference]: Without dead ends: 203725 [2018-11-28 12:32:00,257 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-11-28 12:32:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-11-28 12:32:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-11-28 12:32:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-11-28 12:32:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-11-28 12:32:04,098 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-11-28 12:32:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:04,100 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-11-28 12:32:04,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:32:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-11-28 12:32:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 12:32:04,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:04,112 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] [2018-11-28 12:32:04,112 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:04,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-11-28 12:32:04,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:04,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:04,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:04,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:04,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:32:04,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:32:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:32:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:32:04,208 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 5 states. [2018-11-28 12:32:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:06,843 INFO L93 Difference]: Finished difference Result 325275 states and 1470482 transitions. [2018-11-28 12:32:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:32:06,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 12:32:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:07,798 INFO L225 Difference]: With dead ends: 325275 [2018-11-28 12:32:07,798 INFO L226 Difference]: Without dead ends: 324275 [2018-11-28 12:32:07,798 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-11-28 12:32:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-11-28 12:32:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-11-28 12:32:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-11-28 12:32:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 842877 transitions. [2018-11-28 12:32:17,829 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 842877 transitions. Word has length 53 [2018-11-28 12:32:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:17,830 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 842877 transitions. [2018-11-28 12:32:17,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:32:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 842877 transitions. [2018-11-28 12:32:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:32:17,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:17,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:17,837 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:17,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-11-28 12:32:17,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:17,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:17,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:17,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:17,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:17,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:17,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:32:17,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:32:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:32:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:32:17,913 INFO L87 Difference]: Start difference. First operand 186425 states and 842877 transitions. Second operand 4 states. [2018-11-28 12:32:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:18,674 INFO L93 Difference]: Finished difference Result 163601 states and 727065 transitions. [2018-11-28 12:32:18,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:32:18,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-28 12:32:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:19,153 INFO L225 Difference]: With dead ends: 163601 [2018-11-28 12:32:19,154 INFO L226 Difference]: Without dead ends: 160996 [2018-11-28 12:32:19,154 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-11-28 12:32:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-11-28 12:32:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-11-28 12:32:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-11-28 12:32:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 718378 transitions. [2018-11-28 12:32:23,074 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 718378 transitions. Word has length 54 [2018-11-28 12:32:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:23,074 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 718378 transitions. [2018-11-28 12:32:23,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:32:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 718378 transitions. [2018-11-28 12:32:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:32:23,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:23,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:23,080 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:23,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -955671519, now seen corresponding path program 1 times [2018-11-28 12:32:23,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:23,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:23,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:23,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:23,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:23,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:23,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:32:23,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:23,126 INFO L87 Difference]: Start difference. First operand 160996 states and 718378 transitions. Second operand 3 states. [2018-11-28 12:32:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:23,898 INFO L93 Difference]: Finished difference Result 160996 states and 718281 transitions. [2018-11-28 12:32:23,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:23,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-28 12:32:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:24,345 INFO L225 Difference]: With dead ends: 160996 [2018-11-28 12:32:24,345 INFO L226 Difference]: Without dead ends: 160996 [2018-11-28 12:32:24,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-11-28 12:32:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-11-28 12:32:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-11-28 12:32:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 718281 transitions. [2018-11-28 12:32:28,114 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 718281 transitions. Word has length 55 [2018-11-28 12:32:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:28,114 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 718281 transitions. [2018-11-28 12:32:28,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:32:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 718281 transitions. [2018-11-28 12:32:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 12:32:28,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:28,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:28,121 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:28,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash 787138816, now seen corresponding path program 1 times [2018-11-28 12:32:28,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:28,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:28,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:28,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:28,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:32:28,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:32:28,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:32:28,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:32:28,170 INFO L87 Difference]: Start difference. First operand 160996 states and 718281 transitions. Second operand 5 states. [2018-11-28 12:32:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:32,677 INFO L93 Difference]: Finished difference Result 289852 states and 1287334 transitions. [2018-11-28 12:32:32,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:32:32,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-11-28 12:32:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:33,507 INFO L225 Difference]: With dead ends: 289852 [2018-11-28 12:32:33,507 INFO L226 Difference]: Without dead ends: 289012 [2018-11-28 12:32:33,507 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-11-28 12:32:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289012 states. [2018-11-28 12:32:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289012 to 169616. [2018-11-28 12:32:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169616 states. [2018-11-28 12:32:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169616 states to 169616 states and 753934 transitions. [2018-11-28 12:32:38,333 INFO L78 Accepts]: Start accepts. Automaton has 169616 states and 753934 transitions. Word has length 55 [2018-11-28 12:32:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:38,333 INFO L480 AbstractCegarLoop]: Abstraction has 169616 states and 753934 transitions. [2018-11-28 12:32:38,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:32:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 169616 states and 753934 transitions. [2018-11-28 12:32:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 12:32:38,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:38,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:38,356 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:38,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1233238636, now seen corresponding path program 1 times [2018-11-28 12:32:38,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:38,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:38,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:38,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:38,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:32:38,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:32:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:32:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:32:38,418 INFO L87 Difference]: Start difference. First operand 169616 states and 753934 transitions. Second operand 5 states. [2018-11-28 12:32:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:38,669 INFO L93 Difference]: Finished difference Result 59120 states and 239414 transitions. [2018-11-28 12:32:38,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:32:38,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-28 12:32:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:38,792 INFO L225 Difference]: With dead ends: 59120 [2018-11-28 12:32:38,792 INFO L226 Difference]: Without dead ends: 56808 [2018-11-28 12:32:38,792 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-11-28 12:32:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56808 states. [2018-11-28 12:32:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56808 to 56808. [2018-11-28 12:32:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56808 states. [2018-11-28 12:32:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56808 states to 56808 states and 230752 transitions. [2018-11-28 12:32:40,240 INFO L78 Accepts]: Start accepts. Automaton has 56808 states and 230752 transitions. Word has length 62 [2018-11-28 12:32:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:40,240 INFO L480 AbstractCegarLoop]: Abstraction has 56808 states and 230752 transitions. [2018-11-28 12:32:40,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:32:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 56808 states and 230752 transitions. [2018-11-28 12:32:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:32:40,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:40,250 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] [2018-11-28 12:32:40,250 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:40,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash 49065616, now seen corresponding path program 1 times [2018-11-28 12:32:40,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:40,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:40,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:40,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:40,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:32:40,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:32:40,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:32:40,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:32:40,329 INFO L87 Difference]: Start difference. First operand 56808 states and 230752 transitions. Second operand 4 states. [2018-11-28 12:32:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:40,744 INFO L93 Difference]: Finished difference Result 78972 states and 316077 transitions. [2018-11-28 12:32:40,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:32:40,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 12:32:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:40,918 INFO L225 Difference]: With dead ends: 78972 [2018-11-28 12:32:40,918 INFO L226 Difference]: Without dead ends: 78972 [2018-11-28 12:32:40,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-28 12:32:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78972 states. [2018-11-28 12:32:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78972 to 61564. [2018-11-28 12:32:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61564 states. [2018-11-28 12:32:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61564 states to 61564 states and 248445 transitions. [2018-11-28 12:32:42,660 INFO L78 Accepts]: Start accepts. Automaton has 61564 states and 248445 transitions. Word has length 68 [2018-11-28 12:32:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:42,660 INFO L480 AbstractCegarLoop]: Abstraction has 61564 states and 248445 transitions. [2018-11-28 12:32:42,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:32:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 61564 states and 248445 transitions. [2018-11-28 12:32:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:32:42,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:42,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:42,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:42,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1791875951, now seen corresponding path program 1 times [2018-11-28 12:32:42,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:42,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:42,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:42,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:42,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:42,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:42,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:32:42,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:32:42,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:32:42,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:32:42,725 INFO L87 Difference]: Start difference. First operand 61564 states and 248445 transitions. Second operand 4 states. [2018-11-28 12:32:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:43,345 INFO L93 Difference]: Finished difference Result 85639 states and 341495 transitions. [2018-11-28 12:32:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:32:43,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 12:32:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:43,523 INFO L225 Difference]: With dead ends: 85639 [2018-11-28 12:32:43,523 INFO L226 Difference]: Without dead ends: 85639 [2018-11-28 12:32:43,523 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-11-28 12:32:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85639 states. [2018-11-28 12:32:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85639 to 77176. [2018-11-28 12:32:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77176 states. [2018-11-28 12:32:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77176 states to 77176 states and 309674 transitions. [2018-11-28 12:32:47,119 INFO L78 Accepts]: Start accepts. Automaton has 77176 states and 309674 transitions. Word has length 68 [2018-11-28 12:32:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:47,119 INFO L480 AbstractCegarLoop]: Abstraction has 77176 states and 309674 transitions. [2018-11-28 12:32:47,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:32:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 77176 states and 309674 transitions. [2018-11-28 12:32:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:32:47,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:47,137 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] [2018-11-28 12:32:47,137 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:47,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1149781648, now seen corresponding path program 1 times [2018-11-28 12:32:47,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:47,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:47,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:47,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:47,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:32:47,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:32:47,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:32:47,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:32:47,240 INFO L87 Difference]: Start difference. First operand 77176 states and 309674 transitions. Second operand 6 states. [2018-11-28 12:32:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:47,783 INFO L93 Difference]: Finished difference Result 83796 states and 332727 transitions. [2018-11-28 12:32:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:32:47,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 12:32:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:47,956 INFO L225 Difference]: With dead ends: 83796 [2018-11-28 12:32:47,956 INFO L226 Difference]: Without dead ends: 83796 [2018-11-28 12:32:47,956 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-11-28 12:32:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83796 states. [2018-11-28 12:32:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83796 to 79534. [2018-11-28 12:32:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79534 states. [2018-11-28 12:32:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79534 states to 79534 states and 317786 transitions. [2018-11-28 12:32:49,152 INFO L78 Accepts]: Start accepts. Automaton has 79534 states and 317786 transitions. Word has length 68 [2018-11-28 12:32:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:49,152 INFO L480 AbstractCegarLoop]: Abstraction has 79534 states and 317786 transitions. [2018-11-28 12:32:49,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:32:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 79534 states and 317786 transitions. [2018-11-28 12:32:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 12:32:49,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:49,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] [2018-11-28 12:32:49,406 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:49,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1443184655, now seen corresponding path program 1 times [2018-11-28 12:32:49,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:49,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:49,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:49,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:32:49,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:32:49,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:32:49,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:32:49,454 INFO L87 Difference]: Start difference. First operand 79534 states and 317786 transitions. Second operand 6 states. [2018-11-28 12:32:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:50,159 INFO L93 Difference]: Finished difference Result 102078 states and 405346 transitions. [2018-11-28 12:32:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:32:50,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 12:32:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:50,394 INFO L225 Difference]: With dead ends: 102078 [2018-11-28 12:32:50,394 INFO L226 Difference]: Without dead ends: 101918 [2018-11-28 12:32:50,395 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-11-28 12:32:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101918 states. [2018-11-28 12:32:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101918 to 78062. [2018-11-28 12:32:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78062 states. [2018-11-28 12:32:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78062 states to 78062 states and 311818 transitions. [2018-11-28 12:32:51,734 INFO L78 Accepts]: Start accepts. Automaton has 78062 states and 311818 transitions. Word has length 68 [2018-11-28 12:32:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:51,734 INFO L480 AbstractCegarLoop]: Abstraction has 78062 states and 311818 transitions. [2018-11-28 12:32:51,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:32:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 78062 states and 311818 transitions. [2018-11-28 12:32:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 12:32:52,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:52,161 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] [2018-11-28 12:32:52,161 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:52,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:52,162 INFO L82 PathProgramCache]: Analyzing trace with hash 914872836, now seen corresponding path program 1 times [2018-11-28 12:32:52,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:52,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:52,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:52,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:52,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:52,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:52,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:32:52,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:32:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:32:52,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:32:52,241 INFO L87 Difference]: Start difference. First operand 78062 states and 311818 transitions. Second operand 4 states. [2018-11-28 12:32:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:53,321 INFO L93 Difference]: Finished difference Result 123918 states and 488650 transitions. [2018-11-28 12:32:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:32:53,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-28 12:32:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:53,669 INFO L225 Difference]: With dead ends: 123918 [2018-11-28 12:32:53,669 INFO L226 Difference]: Without dead ends: 123102 [2018-11-28 12:32:53,670 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-11-28 12:32:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123102 states. [2018-11-28 12:32:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123102 to 105182. [2018-11-28 12:32:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105182 states. [2018-11-28 12:32:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105182 states to 105182 states and 418466 transitions. [2018-11-28 12:32:55,803 INFO L78 Accepts]: Start accepts. Automaton has 105182 states and 418466 transitions. Word has length 82 [2018-11-28 12:32:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:32:55,803 INFO L480 AbstractCegarLoop]: Abstraction has 105182 states and 418466 transitions. [2018-11-28 12:32:55,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:32:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 105182 states and 418466 transitions. [2018-11-28 12:32:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 12:32:55,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:32:55,892 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] [2018-11-28 12:32:55,893 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:32:55,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2026784763, now seen corresponding path program 1 times [2018-11-28 12:32:55,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:55,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-11-28 12:32:55,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:55,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:32:55,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:32:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:32:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:32:55,975 INFO L87 Difference]: Start difference. First operand 105182 states and 418466 transitions. Second operand 6 states. [2018-11-28 12:32:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:57,019 INFO L93 Difference]: Finished difference Result 186559 states and 733507 transitions. [2018-11-28 12:32:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:32:57,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-28 12:32:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:32:57,465 INFO L225 Difference]: With dead ends: 186559 [2018-11-28 12:32:57,465 INFO L226 Difference]: Without dead ends: 185535 [2018-11-28 12:32:57,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:32:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185535 states. [2018-11-28 12:33:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185535 to 163343. [2018-11-28 12:33:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163343 states. [2018-11-28 12:33:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163343 states to 163343 states and 647995 transitions. [2018-11-28 12:33:00,674 INFO L78 Accepts]: Start accepts. Automaton has 163343 states and 647995 transitions. Word has length 82 [2018-11-28 12:33:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:00,674 INFO L480 AbstractCegarLoop]: Abstraction has 163343 states and 647995 transitions. [2018-11-28 12:33:00,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:33:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 163343 states and 647995 transitions. [2018-11-28 12:33:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 12:33:01,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:01,344 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] [2018-11-28 12:33:01,344 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:01,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:01,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1974779526, now seen corresponding path program 1 times [2018-11-28 12:33:01,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:01,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:01,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:01,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:01,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:33:01,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:33:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:33:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:33:01,425 INFO L87 Difference]: Start difference. First operand 163343 states and 647995 transitions. Second operand 7 states. [2018-11-28 12:33:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:02,713 INFO L93 Difference]: Finished difference Result 193359 states and 763483 transitions. [2018-11-28 12:33:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:33:02,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-28 12:33:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:03,186 INFO L225 Difference]: With dead ends: 193359 [2018-11-28 12:33:03,187 INFO L226 Difference]: Without dead ends: 193039 [2018-11-28 12:33:03,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:33:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193039 states. [2018-11-28 12:33:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193039 to 172719. [2018-11-28 12:33:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172719 states. [2018-11-28 12:33:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172719 states to 172719 states and 683659 transitions. [2018-11-28 12:33:06,557 INFO L78 Accepts]: Start accepts. Automaton has 172719 states and 683659 transitions. Word has length 82 [2018-11-28 12:33:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:06,557 INFO L480 AbstractCegarLoop]: Abstraction has 172719 states and 683659 transitions. [2018-11-28 12:33:06,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:33:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 172719 states and 683659 transitions. [2018-11-28 12:33:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-28 12:33:06,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:06,744 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] [2018-11-28 12:33:06,745 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:06,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash 394739894, now seen corresponding path program 1 times [2018-11-28 12:33:06,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:06,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:06,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:06,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:06,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:33:06,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:33:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:33:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:33:06,790 INFO L87 Difference]: Start difference. First operand 172719 states and 683659 transitions. Second operand 3 states. [2018-11-28 12:33:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:08,290 INFO L93 Difference]: Finished difference Result 202495 states and 793283 transitions. [2018-11-28 12:33:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:33:08,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-11-28 12:33:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:08,827 INFO L225 Difference]: With dead ends: 202495 [2018-11-28 12:33:08,827 INFO L226 Difference]: Without dead ends: 202495 [2018-11-28 12:33:08,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:33:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202495 states. [2018-11-28 12:33:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202495 to 179711. [2018-11-28 12:33:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179711 states. [2018-11-28 12:33:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179711 states to 179711 states and 708787 transitions. [2018-11-28 12:33:16,101 INFO L78 Accepts]: Start accepts. Automaton has 179711 states and 708787 transitions. Word has length 84 [2018-11-28 12:33:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:16,101 INFO L480 AbstractCegarLoop]: Abstraction has 179711 states and 708787 transitions. [2018-11-28 12:33:16,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:33:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 179711 states and 708787 transitions. [2018-11-28 12:33:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 12:33:16,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:16,324 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] [2018-11-28 12:33:16,324 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:16,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1382200748, now seen corresponding path program 1 times [2018-11-28 12:33:16,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:16,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:16,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:33:16,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:33:16,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:33:16,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:33:16,472 INFO L87 Difference]: Start difference. First operand 179711 states and 708787 transitions. Second operand 10 states. [2018-11-28 12:33:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:18,326 INFO L93 Difference]: Finished difference Result 227791 states and 882395 transitions. [2018-11-28 12:33:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 12:33:18,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-11-28 12:33:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:19,493 INFO L225 Difference]: With dead ends: 227791 [2018-11-28 12:33:19,493 INFO L226 Difference]: Without dead ends: 227471 [2018-11-28 12:33:19,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 12:33:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227471 states. [2018-11-28 12:33:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227471 to 182463. [2018-11-28 12:33:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182463 states. [2018-11-28 12:33:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182463 states to 182463 states and 717107 transitions. [2018-11-28 12:33:23,210 INFO L78 Accepts]: Start accepts. Automaton has 182463 states and 717107 transitions. Word has length 88 [2018-11-28 12:33:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:23,211 INFO L480 AbstractCegarLoop]: Abstraction has 182463 states and 717107 transitions. [2018-11-28 12:33:23,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:33:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 182463 states and 717107 transitions. [2018-11-28 12:33:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 12:33:23,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:23,449 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] [2018-11-28 12:33:23,449 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:23,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 595673719, now seen corresponding path program 1 times [2018-11-28 12:33:23,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:23,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:33:23,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:33:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:33:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:33:23,512 INFO L87 Difference]: Start difference. First operand 182463 states and 717107 transitions. Second operand 4 states. [2018-11-28 12:33:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:25,453 INFO L93 Difference]: Finished difference Result 211365 states and 823407 transitions. [2018-11-28 12:33:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:33:25,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-28 12:33:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:25,995 INFO L225 Difference]: With dead ends: 211365 [2018-11-28 12:33:25,995 INFO L226 Difference]: Without dead ends: 210661 [2018-11-28 12:33:25,996 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-11-28 12:33:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210661 states. [2018-11-28 12:33:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210661 to 203621. [2018-11-28 12:33:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203621 states. [2018-11-28 12:33:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203621 states to 203621 states and 795519 transitions. [2018-11-28 12:33:33,134 INFO L78 Accepts]: Start accepts. Automaton has 203621 states and 795519 transitions. Word has length 90 [2018-11-28 12:33:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:33,134 INFO L480 AbstractCegarLoop]: Abstraction has 203621 states and 795519 transitions. [2018-11-28 12:33:33,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:33:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 203621 states and 795519 transitions. [2018-11-28 12:33:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 12:33:33,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:33,398 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] [2018-11-28 12:33:33,399 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:33,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1339986568, now seen corresponding path program 1 times [2018-11-28 12:33:33,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:33,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:33,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:33,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:33,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:33,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:33,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:33:33,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:33:33,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:33:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:33:33,440 INFO L87 Difference]: Start difference. First operand 203621 states and 795519 transitions. Second operand 3 states. [2018-11-28 12:33:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:35,036 INFO L93 Difference]: Finished difference Result 214893 states and 837979 transitions. [2018-11-28 12:33:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:33:35,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-28 12:33:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:35,604 INFO L225 Difference]: With dead ends: 214893 [2018-11-28 12:33:35,604 INFO L226 Difference]: Without dead ends: 214893 [2018-11-28 12:33:35,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:33:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214893 states. [2018-11-28 12:33:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214893 to 209409. [2018-11-28 12:33:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209409 states. [2018-11-28 12:33:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209409 states to 209409 states and 817287 transitions. [2018-11-28 12:33:40,115 INFO L78 Accepts]: Start accepts. Automaton has 209409 states and 817287 transitions. Word has length 90 [2018-11-28 12:33:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:40,115 INFO L480 AbstractCegarLoop]: Abstraction has 209409 states and 817287 transitions. [2018-11-28 12:33:40,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:33:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 209409 states and 817287 transitions. [2018-11-28 12:33:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 12:33:40,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:40,386 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-11-28 12:33:40,386 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:40,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:40,386 INFO L82 PathProgramCache]: Analyzing trace with hash 418119185, now seen corresponding path program 1 times [2018-11-28 12:33:40,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:40,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:40,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:33:40,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:33:40,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:33:40,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:33:40,455 INFO L87 Difference]: Start difference. First operand 209409 states and 817287 transitions. Second operand 6 states. [2018-11-28 12:33:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:40,553 INFO L93 Difference]: Finished difference Result 27473 states and 91695 transitions. [2018-11-28 12:33:40,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:33:40,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-28 12:33:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:40,586 INFO L225 Difference]: With dead ends: 27473 [2018-11-28 12:33:40,586 INFO L226 Difference]: Without dead ends: 23817 [2018-11-28 12:33:40,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:33:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23817 states. [2018-11-28 12:33:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23817 to 22672. [2018-11-28 12:33:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22672 states. [2018-11-28 12:33:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22672 states to 22672 states and 75834 transitions. [2018-11-28 12:33:40,851 INFO L78 Accepts]: Start accepts. Automaton has 22672 states and 75834 transitions. Word has length 91 [2018-11-28 12:33:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:40,852 INFO L480 AbstractCegarLoop]: Abstraction has 22672 states and 75834 transitions. [2018-11-28 12:33:40,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:33:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 22672 states and 75834 transitions. [2018-11-28 12:33:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-28 12:33:40,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:40,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:40,871 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:40,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1222498172, now seen corresponding path program 1 times [2018-11-28 12:33:40,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:40,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:40,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:40,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:40,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:40,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:40,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:33:40,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:33:40,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:33:40,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:33:40,944 INFO L87 Difference]: Start difference. First operand 22672 states and 75834 transitions. Second operand 5 states. [2018-11-28 12:33:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:41,235 INFO L93 Difference]: Finished difference Result 25406 states and 84381 transitions. [2018-11-28 12:33:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:33:41,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-11-28 12:33:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:41,279 INFO L225 Difference]: With dead ends: 25406 [2018-11-28 12:33:41,279 INFO L226 Difference]: Without dead ends: 25266 [2018-11-28 12:33:41,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-11-28 12:33:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25266 states. [2018-11-28 12:33:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25266 to 22807. [2018-11-28 12:33:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22807 states. [2018-11-28 12:33:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22807 states to 22807 states and 76222 transitions. [2018-11-28 12:33:41,534 INFO L78 Accepts]: Start accepts. Automaton has 22807 states and 76222 transitions. Word has length 101 [2018-11-28 12:33:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:41,535 INFO L480 AbstractCegarLoop]: Abstraction has 22807 states and 76222 transitions. [2018-11-28 12:33:41,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:33:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 22807 states and 76222 transitions. [2018-11-28 12:33:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 12:33:41,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:41,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:41,554 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:41,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -111374128, now seen corresponding path program 1 times [2018-11-28 12:33:41,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:41,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:41,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:33:41,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:33:41,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:33:41,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:33:41,597 INFO L87 Difference]: Start difference. First operand 22807 states and 76222 transitions. Second operand 4 states. [2018-11-28 12:33:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:42,497 INFO L93 Difference]: Finished difference Result 40397 states and 136103 transitions. [2018-11-28 12:33:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:33:42,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-11-28 12:33:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:42,553 INFO L225 Difference]: With dead ends: 40397 [2018-11-28 12:33:42,553 INFO L226 Difference]: Without dead ends: 40257 [2018-11-28 12:33:42,553 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-11-28 12:33:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40257 states. [2018-11-28 12:33:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40257 to 21587. [2018-11-28 12:33:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21587 states. [2018-11-28 12:33:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21587 states to 21587 states and 71871 transitions. [2018-11-28 12:33:42,885 INFO L78 Accepts]: Start accepts. Automaton has 21587 states and 71871 transitions. Word has length 103 [2018-11-28 12:33:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:42,886 INFO L480 AbstractCegarLoop]: Abstraction has 21587 states and 71871 transitions. [2018-11-28 12:33:42,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:33:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 21587 states and 71871 transitions. [2018-11-28 12:33:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 12:33:42,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:42,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:42,906 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:42,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:42,907 INFO L82 PathProgramCache]: Analyzing trace with hash 218391633, now seen corresponding path program 1 times [2018-11-28 12:33:42,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:42,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:42,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:42,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:42,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:33:42,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:33:42,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:33:42,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:33:42,968 INFO L87 Difference]: Start difference. First operand 21587 states and 71871 transitions. Second operand 7 states. [2018-11-28 12:33:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:43,163 INFO L93 Difference]: Finished difference Result 23831 states and 78914 transitions. [2018-11-28 12:33:43,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:33:43,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-28 12:33:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:43,192 INFO L225 Difference]: With dead ends: 23831 [2018-11-28 12:33:43,192 INFO L226 Difference]: Without dead ends: 23831 [2018-11-28 12:33:43,193 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-11-28 12:33:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23831 states. [2018-11-28 12:33:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23831 to 22247. [2018-11-28 12:33:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22247 states. [2018-11-28 12:33:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22247 states to 22247 states and 73859 transitions. [2018-11-28 12:33:43,447 INFO L78 Accepts]: Start accepts. Automaton has 22247 states and 73859 transitions. Word has length 103 [2018-11-28 12:33:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:43,447 INFO L480 AbstractCegarLoop]: Abstraction has 22247 states and 73859 transitions. [2018-11-28 12:33:43,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:33:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 22247 states and 73859 transitions. [2018-11-28 12:33:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 12:33:43,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:43,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:43,467 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:43,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash -964955664, now seen corresponding path program 1 times [2018-11-28 12:33:43,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:43,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:43,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:43,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:43,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:33:43,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:33:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:33:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:33:43,520 INFO L87 Difference]: Start difference. First operand 22247 states and 73859 transitions. Second operand 5 states. [2018-11-28 12:33:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:43,632 INFO L93 Difference]: Finished difference Result 21088 states and 69927 transitions. [2018-11-28 12:33:43,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:33:43,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-28 12:33:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:43,658 INFO L225 Difference]: With dead ends: 21088 [2018-11-28 12:33:43,658 INFO L226 Difference]: Without dead ends: 21088 [2018-11-28 12:33:43,659 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-11-28 12:33:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21088 states. [2018-11-28 12:33:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21088 to 20248. [2018-11-28 12:33:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20248 states. [2018-11-28 12:33:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20248 states to 20248 states and 67440 transitions. [2018-11-28 12:33:43,901 INFO L78 Accepts]: Start accepts. Automaton has 20248 states and 67440 transitions. Word has length 103 [2018-11-28 12:33:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:43,902 INFO L480 AbstractCegarLoop]: Abstraction has 20248 states and 67440 transitions. [2018-11-28 12:33:43,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:33:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20248 states and 67440 transitions. [2018-11-28 12:33:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 12:33:43,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:43,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:43,921 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:43,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1445714032, now seen corresponding path program 1 times [2018-11-28 12:33:43,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:43,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:44,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:33:44,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:33:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:33:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:33:44,034 INFO L87 Difference]: Start difference. First operand 20248 states and 67440 transitions. Second operand 6 states. [2018-11-28 12:33:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:44,183 INFO L93 Difference]: Finished difference Result 18776 states and 61760 transitions. [2018-11-28 12:33:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:33:44,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-28 12:33:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:44,207 INFO L225 Difference]: With dead ends: 18776 [2018-11-28 12:33:44,207 INFO L226 Difference]: Without dead ends: 18776 [2018-11-28 12:33:44,207 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-11-28 12:33:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18776 states. [2018-11-28 12:33:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18776 to 16653. [2018-11-28 12:33:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16653 states. [2018-11-28 12:33:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16653 states to 16653 states and 55184 transitions. [2018-11-28 12:33:44,402 INFO L78 Accepts]: Start accepts. Automaton has 16653 states and 55184 transitions. Word has length 103 [2018-11-28 12:33:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:44,402 INFO L480 AbstractCegarLoop]: Abstraction has 16653 states and 55184 transitions. [2018-11-28 12:33:44,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:33:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 16653 states and 55184 transitions. [2018-11-28 12:33:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 12:33:44,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:44,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:44,416 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:44,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1076412754, now seen corresponding path program 1 times [2018-11-28 12:33:44,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:44,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:44,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:44,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:44,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:44,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:44,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:33:44,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:33:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:33:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:33:44,513 INFO L87 Difference]: Start difference. First operand 16653 states and 55184 transitions. Second operand 6 states. [2018-11-28 12:33:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:44,606 INFO L93 Difference]: Finished difference Result 17473 states and 57290 transitions. [2018-11-28 12:33:44,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:33:44,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-28 12:33:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:44,628 INFO L225 Difference]: With dead ends: 17473 [2018-11-28 12:33:44,628 INFO L226 Difference]: Without dead ends: 17373 [2018-11-28 12:33:44,629 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-11-28 12:33:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17373 states. [2018-11-28 12:33:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17373 to 16328. [2018-11-28 12:33:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2018-11-28 12:33:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 54029 transitions. [2018-11-28 12:33:45,103 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 54029 transitions. Word has length 105 [2018-11-28 12:33:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:45,103 INFO L480 AbstractCegarLoop]: Abstraction has 16328 states and 54029 transitions. [2018-11-28 12:33:45,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:33:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 54029 transitions. [2018-11-28 12:33:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 12:33:45,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:45,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:45,117 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:45,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash -859247533, now seen corresponding path program 1 times [2018-11-28 12:33:45,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:45,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:45,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:45,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:45,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:45,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:33:45,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:33:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:33:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:33:45,189 INFO L87 Difference]: Start difference. First operand 16328 states and 54029 transitions. Second operand 5 states. [2018-11-28 12:33:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:45,337 INFO L93 Difference]: Finished difference Result 18504 states and 61037 transitions. [2018-11-28 12:33:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:33:45,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-28 12:33:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:45,360 INFO L225 Difference]: With dead ends: 18504 [2018-11-28 12:33:45,361 INFO L226 Difference]: Without dead ends: 18376 [2018-11-28 12:33:45,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:33:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18376 states. [2018-11-28 12:33:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18376 to 16520. [2018-11-28 12:33:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2018-11-28 12:33:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 54589 transitions. [2018-11-28 12:33:45,567 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 54589 transitions. Word has length 105 [2018-11-28 12:33:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:45,567 INFO L480 AbstractCegarLoop]: Abstraction has 16520 states and 54589 transitions. [2018-11-28 12:33:45,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:33:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 54589 transitions. [2018-11-28 12:33:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 12:33:45,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:45,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:45,582 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:45,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 385516948, now seen corresponding path program 1 times [2018-11-28 12:33:45,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:45,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:45,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:45,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:33:45,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:33:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:33:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:33:45,668 INFO L87 Difference]: Start difference. First operand 16520 states and 54589 transitions. Second operand 5 states. [2018-11-28 12:33:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:45,746 INFO L93 Difference]: Finished difference Result 23308 states and 77718 transitions. [2018-11-28 12:33:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:33:45,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-28 12:33:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:45,789 INFO L225 Difference]: With dead ends: 23308 [2018-11-28 12:33:45,789 INFO L226 Difference]: Without dead ends: 23308 [2018-11-28 12:33:45,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:33:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23308 states. [2018-11-28 12:33:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23308 to 16190. [2018-11-28 12:33:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16190 states. [2018-11-28 12:33:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16190 states to 16190 states and 53385 transitions. [2018-11-28 12:33:46,033 INFO L78 Accepts]: Start accepts. Automaton has 16190 states and 53385 transitions. Word has length 105 [2018-11-28 12:33:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:46,033 INFO L480 AbstractCegarLoop]: Abstraction has 16190 states and 53385 transitions. [2018-11-28 12:33:46,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:33:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 16190 states and 53385 transitions. [2018-11-28 12:33:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 12:33:46,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:46,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:46,049 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:46,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1355097971, now seen corresponding path program 1 times [2018-11-28 12:33:46,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:46,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:46,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:46,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:46,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:33:46,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:33:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:33:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:33:46,185 INFO L87 Difference]: Start difference. First operand 16190 states and 53385 transitions. Second operand 9 states. [2018-11-28 12:33:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:46,502 INFO L93 Difference]: Finished difference Result 30766 states and 102145 transitions. [2018-11-28 12:33:46,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:33:46,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-28 12:33:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:46,531 INFO L225 Difference]: With dead ends: 30766 [2018-11-28 12:33:46,531 INFO L226 Difference]: Without dead ends: 15602 [2018-11-28 12:33:46,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:33:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15602 states. [2018-11-28 12:33:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15602 to 15602. [2018-11-28 12:33:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15602 states. [2018-11-28 12:33:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15602 states to 15602 states and 51673 transitions. [2018-11-28 12:33:46,783 INFO L78 Accepts]: Start accepts. Automaton has 15602 states and 51673 transitions. Word has length 105 [2018-11-28 12:33:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:46,783 INFO L480 AbstractCegarLoop]: Abstraction has 15602 states and 51673 transitions. [2018-11-28 12:33:46,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:33:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15602 states and 51673 transitions. [2018-11-28 12:33:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 12:33:46,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:46,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:46,809 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:46,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1863121905, now seen corresponding path program 2 times [2018-11-28 12:33:46,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:46,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:33:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:46,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:46,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:33:46,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:33:46,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:33:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:33:46,916 INFO L87 Difference]: Start difference. First operand 15602 states and 51673 transitions. Second operand 9 states. [2018-11-28 12:33:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:47,054 INFO L93 Difference]: Finished difference Result 23230 states and 77514 transitions. [2018-11-28 12:33:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:33:47,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-28 12:33:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:47,064 INFO L225 Difference]: With dead ends: 23230 [2018-11-28 12:33:47,065 INFO L226 Difference]: Without dead ends: 7922 [2018-11-28 12:33:47,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:33:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2018-11-28 12:33:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7922. [2018-11-28 12:33:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7922 states. [2018-11-28 12:33:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 26635 transitions. [2018-11-28 12:33:47,154 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 26635 transitions. Word has length 105 [2018-11-28 12:33:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:47,154 INFO L480 AbstractCegarLoop]: Abstraction has 7922 states and 26635 transitions. [2018-11-28 12:33:47,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:33:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 26635 transitions. [2018-11-28 12:33:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 12:33:47,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:47,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:47,162 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:47,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash -486297935, now seen corresponding path program 3 times [2018-11-28 12:33:47,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:47,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:47,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:33:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:33:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:33:47,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:33:47,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 12:33:47,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 12:33:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 12:33:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:33:47,274 INFO L87 Difference]: Start difference. First operand 7922 states and 26635 transitions. Second operand 12 states. [2018-11-28 12:33:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:33:47,720 INFO L93 Difference]: Finished difference Result 15214 states and 51408 transitions. [2018-11-28 12:33:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 12:33:47,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-11-28 12:33:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:33:47,734 INFO L225 Difference]: With dead ends: 15214 [2018-11-28 12:33:47,734 INFO L226 Difference]: Without dead ends: 10670 [2018-11-28 12:33:47,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-11-28 12:33:47,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10670 states. [2018-11-28 12:33:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10670 to 10006. [2018-11-28 12:33:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10006 states. [2018-11-28 12:33:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 33062 transitions. [2018-11-28 12:33:47,858 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 33062 transitions. Word has length 105 [2018-11-28 12:33:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:33:47,859 INFO L480 AbstractCegarLoop]: Abstraction has 10006 states and 33062 transitions. [2018-11-28 12:33:47,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 12:33:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 33062 transitions. [2018-11-28 12:33:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 12:33:47,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:33:47,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:33:47,868 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:33:47,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:33:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1610066251, now seen corresponding path program 4 times [2018-11-28 12:33:47,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:33:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:33:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:47,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:33:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:33:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:33:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:33:47,919 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:33:48,005 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 12:33:48,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:33:48 BasicIcfg [2018-11-28 12:33:48,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:33:48,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:33:48,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:33:48,007 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:33:48,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:31:39" (3/4) ... [2018-11-28 12:33:48,009 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 12:33:48,098 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ecdb3daf-6434-47ab-9d7a-7c37d9a6af75/bin-2019/uautomizer/witness.graphml [2018-11-28 12:33:48,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:33:48,099 INFO L168 Benchmark]: Toolchain (without parser) took 129553.99 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 950.6 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2018-11-28 12:33:48,101 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:33:48,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:33:48,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:33:48,102 INFO L168 Benchmark]: Boogie Preprocessor took 25.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:33:48,102 INFO L168 Benchmark]: RCFGBuilder took 574.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:33:48,102 INFO L168 Benchmark]: TraceAbstraction took 128431.16 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2018-11-28 12:33:48,102 INFO L168 Benchmark]: Witness Printer took 91.87 ms. Allocated memory is still 8.1 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:33:48,104 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 574.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 128431.16 ms. Allocated memory was 1.2 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. * Witness Printer took 91.87 ms. Allocated memory is still 8.1 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1116; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1116, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1117; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1117, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1118; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1118, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 128.3s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 37.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8201 SDtfs, 8954 SDslu, 19165 SDs, 0 SdLazy, 6339 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 87 SyntacticMatches, 19 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209409occurred in iteration=17, 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: 69.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 574317 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2534 NumberOfCodeBlocks, 2534 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2400 ConstructedInterpolants, 0 QuantifiedInterpolants, 497747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...