./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc_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_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/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 247fffb4c4c4e8dbb064b88db3e3880682574298 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:28:39,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:28:39,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:28:39,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:28:39,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:28:39,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:28:39,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:28:39,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:28:39,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:28:39,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:28:39,673 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:28:39,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:28:39,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:28:39,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:28:39,676 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:28:39,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:28:39,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:28:39,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:28:39,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:28:39,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:28:39,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:28:39,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:28:39,684 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:28:39,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:28:39,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:28:39,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:28:39,685 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:28:39,686 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:28:39,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:28:39,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:28:39,687 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:28:39,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:28:39,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:28:39,688 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:28:39,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:28:39,688 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:28:39,688 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:28:39,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:28:39,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:28:39,696 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:28:39,696 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:28:39,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:28:39,697 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:28:39,697 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:28:39,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:28:39,697 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:28:39,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:28:39,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:28:39,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:28:39,698 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:28:39,698 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:28:39,698 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:28:39,698 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:28:39,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:28:39,698 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:28:39,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:28:39,699 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:28:39,699 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:28:39,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:28:39,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:28:39,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:28:39,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:28:39,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:28:39,700 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:28:39,700 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:28:39,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:28:39,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:28:39,700 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_32db8f37-a911-4aa9-955c-233881c6d533/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 -> 247fffb4c4c4e8dbb064b88db3e3880682574298 [2018-11-28 13:28:39,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:28:39,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:28:39,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:28:39,738 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:28:39,738 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:28:39,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc_false-unreach-call.i [2018-11-28 13:28:39,787 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/data/3165ab7e1/8dc5bb41d935423984cf59f883c145a7/FLAG6ad103130 [2018-11-28 13:28:40,170 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:28:40,171 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/sv-benchmarks/c/pthread-wmm/mix054_pso.oepc_false-unreach-call.i [2018-11-28 13:28:40,182 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/data/3165ab7e1/8dc5bb41d935423984cf59f883c145a7/FLAG6ad103130 [2018-11-28 13:28:40,550 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/data/3165ab7e1/8dc5bb41d935423984cf59f883c145a7 [2018-11-28 13:28:40,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:28:40,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:28:40,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:28:40,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:28:40,557 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:28:40,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:40,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b0f4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40, skipping insertion in model container [2018-11-28 13:28:40,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:40,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:28:40,598 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:28:40,827 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:28:40,836 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:28:40,932 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:28:40,966 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:28:40,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40 WrapperNode [2018-11-28 13:28:40,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:28:40,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:28:40,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:28:40,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:28:40,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:40,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:28:41,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:28:41,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:28:41,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:28:41,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... [2018-11-28 13:28:41,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:28:41,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:28:41,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:28:41,037 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:28:41,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/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 13:28:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:28:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:28:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:28:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:28:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:28:41,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:28:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:28:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:28:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:28:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:28:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:28:41,083 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 13:28:41,572 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:28:41,573 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:28:41,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:28:41 BoogieIcfgContainer [2018-11-28 13:28:41,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:28:41,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:28:41,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:28:41,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:28:41,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:28:40" (1/3) ... [2018-11-28 13:28:41,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476246c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:28:41, skipping insertion in model container [2018-11-28 13:28:41,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:28:40" (2/3) ... [2018-11-28 13:28:41,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476246c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:28:41, skipping insertion in model container [2018-11-28 13:28:41,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:28:41" (3/3) ... [2018-11-28 13:28:41,579 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc_false-unreach-call.i [2018-11-28 13:28:41,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,615 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,615 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,615 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,616 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,616 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,616 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,616 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,622 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,623 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,623 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,623 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,624 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,625 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:28:41,655 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:28:41,655 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:28:41,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:28:41,672 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:28:41,691 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:28:41,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:28:41,691 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:28:41,691 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:28:41,691 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:28:41,691 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:28:41,692 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:28:41,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:28:41,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:28:41,701 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-11-28 13:28:43,702 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2018-11-28 13:28:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2018-11-28 13:28:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:28:43,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:43,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:43,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:43,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:43,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1272153477, now seen corresponding path program 1 times [2018-11-28 13:28:43,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:43,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:43,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:43,887 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 13:28:43,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:43,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:28:43,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:28:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:28:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:28:43,907 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2018-11-28 13:28:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:44,525 INFO L93 Difference]: Finished difference Result 60789 states and 234492 transitions. [2018-11-28 13:28:44,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:28:44,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-28 13:28:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:44,715 INFO L225 Difference]: With dead ends: 60789 [2018-11-28 13:28:44,715 INFO L226 Difference]: Without dead ends: 44269 [2018-11-28 13:28:44,717 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 13:28:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44269 states. [2018-11-28 13:28:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44269 to 27337. [2018-11-28 13:28:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2018-11-28 13:28:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2018-11-28 13:28:45,715 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2018-11-28 13:28:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:45,716 INFO L480 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2018-11-28 13:28:45,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:28:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2018-11-28 13:28:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:28:45,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:45,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:45,723 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:45,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1559910934, now seen corresponding path program 1 times [2018-11-28 13:28:45,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:45,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:45,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:45,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:45,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:45,787 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 13:28:45,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:45,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:28:45,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:28:45,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:28:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:28:45,789 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 4 states. [2018-11-28 13:28:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:45,890 INFO L93 Difference]: Finished difference Result 8527 states and 28343 transitions. [2018-11-28 13:28:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:28:45,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-28 13:28:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:45,906 INFO L225 Difference]: With dead ends: 8527 [2018-11-28 13:28:45,906 INFO L226 Difference]: Without dead ends: 7465 [2018-11-28 13:28:45,907 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 13:28:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-11-28 13:28:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7465. [2018-11-28 13:28:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2018-11-28 13:28:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24635 transitions. [2018-11-28 13:28:46,010 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24635 transitions. Word has length 44 [2018-11-28 13:28:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:46,011 INFO L480 AbstractCegarLoop]: Abstraction has 7465 states and 24635 transitions. [2018-11-28 13:28:46,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:28:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24635 transitions. [2018-11-28 13:28:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:28:46,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:46,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:46,013 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:46,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:46,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1459656693, now seen corresponding path program 1 times [2018-11-28 13:28:46,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:46,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:46,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:46,083 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 13:28:46,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:46,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:46,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:46,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:46,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:46,084 INFO L87 Difference]: Start difference. First operand 7465 states and 24635 transitions. Second operand 5 states. [2018-11-28 13:28:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:46,363 INFO L93 Difference]: Finished difference Result 13997 states and 45804 transitions. [2018-11-28 13:28:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:28:46,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 13:28:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:46,397 INFO L225 Difference]: With dead ends: 13997 [2018-11-28 13:28:46,398 INFO L226 Difference]: Without dead ends: 13929 [2018-11-28 13:28:46,398 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 13:28:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2018-11-28 13:28:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 9440. [2018-11-28 13:28:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2018-11-28 13:28:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 30541 transitions. [2018-11-28 13:28:46,747 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 30541 transitions. Word has length 45 [2018-11-28 13:28:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:46,748 INFO L480 AbstractCegarLoop]: Abstraction has 9440 states and 30541 transitions. [2018-11-28 13:28:46,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 30541 transitions. [2018-11-28 13:28:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:28:46,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:46,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:46,751 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:46,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1598559727, now seen corresponding path program 1 times [2018-11-28 13:28:46,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:46,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:46,811 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 13:28:46,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:46,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:28:46,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:28:46,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:28:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:28:46,813 INFO L87 Difference]: Start difference. First operand 9440 states and 30541 transitions. Second operand 3 states. [2018-11-28 13:28:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:46,884 INFO L93 Difference]: Finished difference Result 13278 states and 42640 transitions. [2018-11-28 13:28:46,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:28:46,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 13:28:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:46,907 INFO L225 Difference]: With dead ends: 13278 [2018-11-28 13:28:46,907 INFO L226 Difference]: Without dead ends: 13278 [2018-11-28 13:28:46,907 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 13:28:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-11-28 13:28:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 9844. [2018-11-28 13:28:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-11-28 13:28:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 31507 transitions. [2018-11-28 13:28:47,059 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 31507 transitions. Word has length 47 [2018-11-28 13:28:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:47,060 INFO L480 AbstractCegarLoop]: Abstraction has 9844 states and 31507 transitions. [2018-11-28 13:28:47,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:28:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 31507 transitions. [2018-11-28 13:28:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:28:47,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:47,062 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] [2018-11-28 13:28:47,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:47,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -108379620, now seen corresponding path program 1 times [2018-11-28 13:28:47,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:47,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:47,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:47,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:47,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:47,147 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 13:28:47,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:47,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:28:47,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:28:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:28:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:28:47,148 INFO L87 Difference]: Start difference. First operand 9844 states and 31507 transitions. Second operand 7 states. [2018-11-28 13:28:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:47,583 INFO L93 Difference]: Finished difference Result 12284 states and 38672 transitions. [2018-11-28 13:28:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:28:47,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-28 13:28:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:47,601 INFO L225 Difference]: With dead ends: 12284 [2018-11-28 13:28:47,601 INFO L226 Difference]: Without dead ends: 12212 [2018-11-28 13:28:47,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:28:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2018-11-28 13:28:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 10848. [2018-11-28 13:28:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10848 states. [2018-11-28 13:28:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10848 states to 10848 states and 34562 transitions. [2018-11-28 13:28:47,752 INFO L78 Accepts]: Start accepts. Automaton has 10848 states and 34562 transitions. Word has length 51 [2018-11-28 13:28:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:47,752 INFO L480 AbstractCegarLoop]: Abstraction has 10848 states and 34562 transitions. [2018-11-28 13:28:47,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:28:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 10848 states and 34562 transitions. [2018-11-28 13:28:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:28:47,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:47,758 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] [2018-11-28 13:28:47,758 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:47,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1204429704, now seen corresponding path program 1 times [2018-11-28 13:28:47,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:47,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:47,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:47,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:28:47,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:28:47,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:28:47,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:28:47,822 INFO L87 Difference]: Start difference. First operand 10848 states and 34562 transitions. Second operand 4 states. [2018-11-28 13:28:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:47,914 INFO L93 Difference]: Finished difference Result 12395 states and 39571 transitions. [2018-11-28 13:28:47,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:28:47,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-28 13:28:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:47,931 INFO L225 Difference]: With dead ends: 12395 [2018-11-28 13:28:47,932 INFO L226 Difference]: Without dead ends: 12395 [2018-11-28 13:28:47,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2018-11-28 13:28:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 11368. [2018-11-28 13:28:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2018-11-28 13:28:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 36235 transitions. [2018-11-28 13:28:48,093 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 36235 transitions. Word has length 59 [2018-11-28 13:28:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:48,094 INFO L480 AbstractCegarLoop]: Abstraction has 11368 states and 36235 transitions. [2018-11-28 13:28:48,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:28:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 36235 transitions. [2018-11-28 13:28:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:28:48,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:48,098 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] [2018-11-28 13:28:48,098 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:48,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:48,099 INFO L82 PathProgramCache]: Analyzing trace with hash 538380631, now seen corresponding path program 1 times [2018-11-28 13:28:48,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:48,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:48,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:48,178 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 13:28:48,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:48,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:28:48,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:28:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:28:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:28:48,179 INFO L87 Difference]: Start difference. First operand 11368 states and 36235 transitions. Second operand 6 states. [2018-11-28 13:28:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:48,512 INFO L93 Difference]: Finished difference Result 20968 states and 66485 transitions. [2018-11-28 13:28:48,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:28:48,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-28 13:28:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:48,548 INFO L225 Difference]: With dead ends: 20968 [2018-11-28 13:28:48,548 INFO L226 Difference]: Without dead ends: 20897 [2018-11-28 13:28:48,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:28:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2018-11-28 13:28:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 13754. [2018-11-28 13:28:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2018-11-28 13:28:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 43279 transitions. [2018-11-28 13:28:48,917 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 43279 transitions. Word has length 59 [2018-11-28 13:28:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:48,918 INFO L480 AbstractCegarLoop]: Abstraction has 13754 states and 43279 transitions. [2018-11-28 13:28:48,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:28:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 43279 transitions. [2018-11-28 13:28:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:28:48,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:48,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:48,925 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:48,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1067585964, now seen corresponding path program 1 times [2018-11-28 13:28:48,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:48,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:48,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:48,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:48,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:28:48,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:28:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:28:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:28:48,997 INFO L87 Difference]: Start difference. First operand 13754 states and 43279 transitions. Second operand 4 states. [2018-11-28 13:28:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:49,343 INFO L93 Difference]: Finished difference Result 20200 states and 61902 transitions. [2018-11-28 13:28:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:28:49,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 13:28:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:49,370 INFO L225 Difference]: With dead ends: 20200 [2018-11-28 13:28:49,370 INFO L226 Difference]: Without dead ends: 20200 [2018-11-28 13:28:49,370 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 13:28:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2018-11-28 13:28:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 15792. [2018-11-28 13:28:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2018-11-28 13:28:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 49060 transitions. [2018-11-28 13:28:49,585 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 49060 transitions. Word has length 63 [2018-11-28 13:28:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:49,585 INFO L480 AbstractCegarLoop]: Abstraction has 15792 states and 49060 transitions. [2018-11-28 13:28:49,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:28:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 49060 transitions. [2018-11-28 13:28:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:28:49,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:49,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:49,592 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:49,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1009623379, now seen corresponding path program 1 times [2018-11-28 13:28:49,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:49,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:49,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:49,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:49,664 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 13:28:49,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:49,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:28:49,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:28:49,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:28:49,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:28:49,665 INFO L87 Difference]: Start difference. First operand 15792 states and 49060 transitions. Second operand 4 states. [2018-11-28 13:28:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:49,852 INFO L93 Difference]: Finished difference Result 19959 states and 61084 transitions. [2018-11-28 13:28:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:28:49,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 13:28:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:49,878 INFO L225 Difference]: With dead ends: 19959 [2018-11-28 13:28:49,878 INFO L226 Difference]: Without dead ends: 19959 [2018-11-28 13:28:49,878 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 13:28:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2018-11-28 13:28:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 16086. [2018-11-28 13:28:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2018-11-28 13:28:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 49917 transitions. [2018-11-28 13:28:50,090 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 49917 transitions. Word has length 63 [2018-11-28 13:28:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:50,091 INFO L480 AbstractCegarLoop]: Abstraction has 16086 states and 49917 transitions. [2018-11-28 13:28:50,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:28:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 49917 transitions. [2018-11-28 13:28:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:28:50,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:50,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:50,097 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:50,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:50,097 INFO L82 PathProgramCache]: Analyzing trace with hash 754886834, now seen corresponding path program 1 times [2018-11-28 13:28:50,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:50,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:50,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:50,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:50,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:50,144 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 13:28:50,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:50,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:28:50,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:28:50,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:28:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:28:50,146 INFO L87 Difference]: Start difference. First operand 16086 states and 49917 transitions. Second operand 3 states. [2018-11-28 13:28:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:50,316 INFO L93 Difference]: Finished difference Result 16558 states and 51205 transitions. [2018-11-28 13:28:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:28:50,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-28 13:28:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:50,337 INFO L225 Difference]: With dead ends: 16558 [2018-11-28 13:28:50,337 INFO L226 Difference]: Without dead ends: 16558 [2018-11-28 13:28:50,337 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 13:28:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2018-11-28 13:28:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 16322. [2018-11-28 13:28:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2018-11-28 13:28:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 50541 transitions. [2018-11-28 13:28:50,624 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 50541 transitions. Word has length 63 [2018-11-28 13:28:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:50,624 INFO L480 AbstractCegarLoop]: Abstraction has 16322 states and 50541 transitions. [2018-11-28 13:28:50,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:28:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 50541 transitions. [2018-11-28 13:28:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:28:50,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:50,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:50,631 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:50,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1952113636, now seen corresponding path program 1 times [2018-11-28 13:28:50,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:50,728 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 13:28:50,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:50,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:28:50,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:28:50,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:28:50,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:28:50,729 INFO L87 Difference]: Start difference. First operand 16322 states and 50541 transitions. Second operand 6 states. [2018-11-28 13:28:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:51,010 INFO L93 Difference]: Finished difference Result 17646 states and 53545 transitions. [2018-11-28 13:28:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:28:51,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-28 13:28:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:51,032 INFO L225 Difference]: With dead ends: 17646 [2018-11-28 13:28:51,032 INFO L226 Difference]: Without dead ends: 17646 [2018-11-28 13:28:51,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:28:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2018-11-28 13:28:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 16546. [2018-11-28 13:28:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16546 states. [2018-11-28 13:28:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 50764 transitions. [2018-11-28 13:28:51,235 INFO L78 Accepts]: Start accepts. Automaton has 16546 states and 50764 transitions. Word has length 65 [2018-11-28 13:28:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:51,235 INFO L480 AbstractCegarLoop]: Abstraction has 16546 states and 50764 transitions. [2018-11-28 13:28:51,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:28:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16546 states and 50764 transitions. [2018-11-28 13:28:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:28:51,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:51,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:51,242 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:51,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash -707349155, now seen corresponding path program 1 times [2018-11-28 13:28:51,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:51,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:51,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:51,326 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 13:28:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:51,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:51,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:51,327 INFO L87 Difference]: Start difference. First operand 16546 states and 50764 transitions. Second operand 5 states. [2018-11-28 13:28:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:51,864 INFO L93 Difference]: Finished difference Result 21334 states and 64873 transitions. [2018-11-28 13:28:51,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:28:51,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 13:28:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:51,893 INFO L225 Difference]: With dead ends: 21334 [2018-11-28 13:28:51,893 INFO L226 Difference]: Without dead ends: 21334 [2018-11-28 13:28:51,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:28:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21334 states. [2018-11-28 13:28:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21334 to 19570. [2018-11-28 13:28:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2018-11-28 13:28:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 59494 transitions. [2018-11-28 13:28:52,125 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 59494 transitions. Word has length 65 [2018-11-28 13:28:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:52,125 INFO L480 AbstractCegarLoop]: Abstraction has 19570 states and 59494 transitions. [2018-11-28 13:28:52,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 59494 transitions. [2018-11-28 13:28:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:28:52,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:52,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:52,132 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:52,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:52,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1217883332, now seen corresponding path program 1 times [2018-11-28 13:28:52,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:52,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:52,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:52,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:52,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:52,209 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 13:28:52,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:52,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:52,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:52,211 INFO L87 Difference]: Start difference. First operand 19570 states and 59494 transitions. Second operand 5 states. [2018-11-28 13:28:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:52,545 INFO L93 Difference]: Finished difference Result 30156 states and 90237 transitions. [2018-11-28 13:28:52,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:28:52,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 13:28:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:52,586 INFO L225 Difference]: With dead ends: 30156 [2018-11-28 13:28:52,586 INFO L226 Difference]: Without dead ends: 30156 [2018-11-28 13:28:52,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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 13:28:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2018-11-28 13:28:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 26760. [2018-11-28 13:28:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26760 states. [2018-11-28 13:28:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26760 states to 26760 states and 80370 transitions. [2018-11-28 13:28:52,984 INFO L78 Accepts]: Start accepts. Automaton has 26760 states and 80370 transitions. Word has length 65 [2018-11-28 13:28:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:52,984 INFO L480 AbstractCegarLoop]: Abstraction has 26760 states and 80370 transitions. [2018-11-28 13:28:52,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 26760 states and 80370 transitions. [2018-11-28 13:28:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:28:52,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:52,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:52,997 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:52,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1269629501, now seen corresponding path program 1 times [2018-11-28 13:28:52,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:52,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:52,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:53,077 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 13:28:53,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:53,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:53,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:53,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:53,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:53,078 INFO L87 Difference]: Start difference. First operand 26760 states and 80370 transitions. Second operand 5 states. [2018-11-28 13:28:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:53,146 INFO L93 Difference]: Finished difference Result 8084 states and 19691 transitions. [2018-11-28 13:28:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:28:53,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 13:28:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:53,156 INFO L225 Difference]: With dead ends: 8084 [2018-11-28 13:28:53,156 INFO L226 Difference]: Without dead ends: 6316 [2018-11-28 13:28:53,156 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 13:28:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2018-11-28 13:28:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 4889. [2018-11-28 13:28:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4889 states. [2018-11-28 13:28:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 11646 transitions. [2018-11-28 13:28:53,227 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 11646 transitions. Word has length 65 [2018-11-28 13:28:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:53,227 INFO L480 AbstractCegarLoop]: Abstraction has 4889 states and 11646 transitions. [2018-11-28 13:28:53,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 11646 transitions. [2018-11-28 13:28:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:28:53,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:53,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:53,231 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:53,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2026999384, now seen corresponding path program 1 times [2018-11-28 13:28:53,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:53,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:53,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:53,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:53,263 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 13:28:53,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:53,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:28:53,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:28:53,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:28:53,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:28:53,264 INFO L87 Difference]: Start difference. First operand 4889 states and 11646 transitions. Second operand 3 states. [2018-11-28 13:28:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:53,301 INFO L93 Difference]: Finished difference Result 6692 states and 15894 transitions. [2018-11-28 13:28:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:28:53,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 13:28:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:53,308 INFO L225 Difference]: With dead ends: 6692 [2018-11-28 13:28:53,308 INFO L226 Difference]: Without dead ends: 6692 [2018-11-28 13:28:53,309 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 13:28:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6692 states. [2018-11-28 13:28:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6692 to 4832. [2018-11-28 13:28:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2018-11-28 13:28:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 11279 transitions. [2018-11-28 13:28:53,375 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 11279 transitions. Word has length 65 [2018-11-28 13:28:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:53,376 INFO L480 AbstractCegarLoop]: Abstraction has 4832 states and 11279 transitions. [2018-11-28 13:28:53,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:28:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 11279 transitions. [2018-11-28 13:28:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:28:53,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:53,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:53,383 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:53,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1343049765, now seen corresponding path program 1 times [2018-11-28 13:28:53,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:53,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:53,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:53,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:53,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:53,441 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 13:28:53,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:53,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:53,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:53,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:53,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:53,443 INFO L87 Difference]: Start difference. First operand 4832 states and 11279 transitions. Second operand 5 states. [2018-11-28 13:28:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:53,575 INFO L93 Difference]: Finished difference Result 5855 states and 13632 transitions. [2018-11-28 13:28:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:28:53,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-28 13:28:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:53,581 INFO L225 Difference]: With dead ends: 5855 [2018-11-28 13:28:53,581 INFO L226 Difference]: Without dead ends: 5855 [2018-11-28 13:28:53,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:28:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2018-11-28 13:28:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5224. [2018-11-28 13:28:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-11-28 13:28:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 12180 transitions. [2018-11-28 13:28:53,645 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 12180 transitions. Word has length 71 [2018-11-28 13:28:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:53,645 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 12180 transitions. [2018-11-28 13:28:53,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 12180 transitions. [2018-11-28 13:28:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:28:53,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:53,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:53,654 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:53,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash 399760570, now seen corresponding path program 1 times [2018-11-28 13:28:53,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:53,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:53,841 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 13:28:53,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:53,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:28:53,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:28:53,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:28:53,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:28:53,842 INFO L87 Difference]: Start difference. First operand 5224 states and 12180 transitions. Second operand 9 states. [2018-11-28 13:28:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:54,215 INFO L93 Difference]: Finished difference Result 7087 states and 16418 transitions. [2018-11-28 13:28:54,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:28:54,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-11-28 13:28:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:54,220 INFO L225 Difference]: With dead ends: 7087 [2018-11-28 13:28:54,220 INFO L226 Difference]: Without dead ends: 7032 [2018-11-28 13:28:54,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:28:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2018-11-28 13:28:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 5292. [2018-11-28 13:28:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5292 states. [2018-11-28 13:28:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 12246 transitions. [2018-11-28 13:28:54,263 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 12246 transitions. Word has length 71 [2018-11-28 13:28:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:54,263 INFO L480 AbstractCegarLoop]: Abstraction has 5292 states and 12246 transitions. [2018-11-28 13:28:54,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:28:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 12246 transitions. [2018-11-28 13:28:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 13:28:54,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:54,267 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 13:28:54,267 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:54,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2052149765, now seen corresponding path program 1 times [2018-11-28 13:28:54,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:54,318 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 13:28:54,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:54,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:28:54,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:28:54,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:28:54,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:28:54,319 INFO L87 Difference]: Start difference. First operand 5292 states and 12246 transitions. Second operand 3 states. [2018-11-28 13:28:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:54,415 INFO L93 Difference]: Finished difference Result 7021 states and 15768 transitions. [2018-11-28 13:28:54,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:28:54,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-28 13:28:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:54,421 INFO L225 Difference]: With dead ends: 7021 [2018-11-28 13:28:54,421 INFO L226 Difference]: Without dead ends: 6693 [2018-11-28 13:28:54,421 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 13:28:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2018-11-28 13:28:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 6163. [2018-11-28 13:28:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6163 states. [2018-11-28 13:28:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6163 states to 6163 states and 14048 transitions. [2018-11-28 13:28:54,476 INFO L78 Accepts]: Start accepts. Automaton has 6163 states and 14048 transitions. Word has length 90 [2018-11-28 13:28:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:54,477 INFO L480 AbstractCegarLoop]: Abstraction has 6163 states and 14048 transitions. [2018-11-28 13:28:54,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:28:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6163 states and 14048 transitions. [2018-11-28 13:28:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 13:28:54,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:54,482 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 13:28:54,482 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:54,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2025793365, now seen corresponding path program 1 times [2018-11-28 13:28:54,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:54,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:54,544 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 13:28:54,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:54,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:28:54,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:28:54,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:28:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:28:54,545 INFO L87 Difference]: Start difference. First operand 6163 states and 14048 transitions. Second operand 4 states. [2018-11-28 13:28:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:54,607 INFO L93 Difference]: Finished difference Result 6551 states and 14955 transitions. [2018-11-28 13:28:54,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:28:54,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-28 13:28:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:54,614 INFO L225 Difference]: With dead ends: 6551 [2018-11-28 13:28:54,614 INFO L226 Difference]: Without dead ends: 6551 [2018-11-28 13:28:54,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 13:28:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6551 states. [2018-11-28 13:28:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6551 to 6087. [2018-11-28 13:28:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6087 states. [2018-11-28 13:28:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 13961 transitions. [2018-11-28 13:28:54,685 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 13961 transitions. Word has length 90 [2018-11-28 13:28:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:54,685 INFO L480 AbstractCegarLoop]: Abstraction has 6087 states and 13961 transitions. [2018-11-28 13:28:54,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:28:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 13961 transitions. [2018-11-28 13:28:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:54,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:54,690 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] [2018-11-28 13:28:54,690 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:54,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:54,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1808901631, now seen corresponding path program 1 times [2018-11-28 13:28:54,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:54,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:28:54,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:54,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:54,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:54,741 INFO L87 Difference]: Start difference. First operand 6087 states and 13961 transitions. Second operand 5 states. [2018-11-28 13:28:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:54,843 INFO L93 Difference]: Finished difference Result 7052 states and 16062 transitions. [2018-11-28 13:28:54,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:28:54,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 13:28:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:54,851 INFO L225 Difference]: With dead ends: 7052 [2018-11-28 13:28:54,852 INFO L226 Difference]: Without dead ends: 7052 [2018-11-28 13:28:54,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:28:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7052 states. [2018-11-28 13:28:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7052 to 5452. [2018-11-28 13:28:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5452 states. [2018-11-28 13:28:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5452 states to 5452 states and 12506 transitions. [2018-11-28 13:28:54,925 INFO L78 Accepts]: Start accepts. Automaton has 5452 states and 12506 transitions. Word has length 92 [2018-11-28 13:28:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:54,926 INFO L480 AbstractCegarLoop]: Abstraction has 5452 states and 12506 transitions. [2018-11-28 13:28:54,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5452 states and 12506 transitions. [2018-11-28 13:28:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:54,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:54,932 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] [2018-11-28 13:28:54,932 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:54,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2063638176, now seen corresponding path program 1 times [2018-11-28 13:28:54,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:54,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:54,981 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 13:28:54,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:54,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:54,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:54,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:54,982 INFO L87 Difference]: Start difference. First operand 5452 states and 12506 transitions. Second operand 5 states. [2018-11-28 13:28:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:55,300 INFO L93 Difference]: Finished difference Result 9104 states and 21056 transitions. [2018-11-28 13:28:55,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:28:55,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 13:28:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:55,310 INFO L225 Difference]: With dead ends: 9104 [2018-11-28 13:28:55,310 INFO L226 Difference]: Without dead ends: 9088 [2018-11-28 13:28:55,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:28:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-11-28 13:28:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 6276. [2018-11-28 13:28:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-11-28 13:28:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14440 transitions. [2018-11-28 13:28:55,401 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14440 transitions. Word has length 92 [2018-11-28 13:28:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:55,401 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14440 transitions. [2018-11-28 13:28:55,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14440 transitions. [2018-11-28 13:28:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:55,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:55,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:55,407 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -818873695, now seen corresponding path program 1 times [2018-11-28 13:28:55,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:55,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:55,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:55,467 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 13:28:55,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:55,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:28:55,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:28:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:28:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:28:55,468 INFO L87 Difference]: Start difference. First operand 6276 states and 14440 transitions. Second operand 6 states. [2018-11-28 13:28:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:55,699 INFO L93 Difference]: Finished difference Result 8414 states and 19086 transitions. [2018-11-28 13:28:55,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:28:55,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 13:28:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:55,708 INFO L225 Difference]: With dead ends: 8414 [2018-11-28 13:28:55,708 INFO L226 Difference]: Without dead ends: 8414 [2018-11-28 13:28:55,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:28:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2018-11-28 13:28:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 6415. [2018-11-28 13:28:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6415 states. [2018-11-28 13:28:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6415 states to 6415 states and 14631 transitions. [2018-11-28 13:28:55,774 INFO L78 Accepts]: Start accepts. Automaton has 6415 states and 14631 transitions. Word has length 92 [2018-11-28 13:28:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:55,774 INFO L480 AbstractCegarLoop]: Abstraction has 6415 states and 14631 transitions. [2018-11-28 13:28:55,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:28:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6415 states and 14631 transitions. [2018-11-28 13:28:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:55,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:55,780 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] [2018-11-28 13:28:55,780 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:55,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1106125426, now seen corresponding path program 1 times [2018-11-28 13:28:55,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:55,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:55,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:55,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:55,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:55,916 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 13:28:55,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:55,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:28:55,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:28:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:28:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:28:55,917 INFO L87 Difference]: Start difference. First operand 6415 states and 14631 transitions. Second operand 7 states. [2018-11-28 13:28:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:56,166 INFO L93 Difference]: Finished difference Result 8436 states and 18916 transitions. [2018-11-28 13:28:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:28:56,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 13:28:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:56,176 INFO L225 Difference]: With dead ends: 8436 [2018-11-28 13:28:56,176 INFO L226 Difference]: Without dead ends: 8328 [2018-11-28 13:28:56,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:28:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2018-11-28 13:28:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 6889. [2018-11-28 13:28:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6889 states. [2018-11-28 13:28:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6889 states to 6889 states and 15624 transitions. [2018-11-28 13:28:56,254 INFO L78 Accepts]: Start accepts. Automaton has 6889 states and 15624 transitions. Word has length 92 [2018-11-28 13:28:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:56,254 INFO L480 AbstractCegarLoop]: Abstraction has 6889 states and 15624 transitions. [2018-11-28 13:28:56,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:28:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6889 states and 15624 transitions. [2018-11-28 13:28:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:56,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:56,260 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] [2018-11-28 13:28:56,260 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:56,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash -42974929, now seen corresponding path program 1 times [2018-11-28 13:28:56,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:56,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:56,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:56,361 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 13:28:56,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:56,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:28:56,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:28:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:28:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:28:56,362 INFO L87 Difference]: Start difference. First operand 6889 states and 15624 transitions. Second operand 9 states. [2018-11-28 13:28:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:56,674 INFO L93 Difference]: Finished difference Result 10023 states and 22701 transitions. [2018-11-28 13:28:56,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 13:28:56,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-11-28 13:28:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:56,681 INFO L225 Difference]: With dead ends: 10023 [2018-11-28 13:28:56,681 INFO L226 Difference]: Without dead ends: 9991 [2018-11-28 13:28:56,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:28:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9991 states. [2018-11-28 13:28:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9991 to 8967. [2018-11-28 13:28:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8967 states. [2018-11-28 13:28:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 20311 transitions. [2018-11-28 13:28:56,756 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 20311 transitions. Word has length 92 [2018-11-28 13:28:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:56,756 INFO L480 AbstractCegarLoop]: Abstraction has 8967 states and 20311 transitions. [2018-11-28 13:28:56,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:28:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 20311 transitions. [2018-11-28 13:28:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:56,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:56,764 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] [2018-11-28 13:28:56,764 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:56,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1839926288, now seen corresponding path program 1 times [2018-11-28 13:28:56,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:56,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:56,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:56,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:56,847 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 13:28:56,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:56,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:28:56,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:28:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:28:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:28:56,848 INFO L87 Difference]: Start difference. First operand 8967 states and 20311 transitions. Second operand 8 states. [2018-11-28 13:28:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:57,120 INFO L93 Difference]: Finished difference Result 13824 states and 32078 transitions. [2018-11-28 13:28:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:28:57,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-11-28 13:28:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:57,132 INFO L225 Difference]: With dead ends: 13824 [2018-11-28 13:28:57,132 INFO L226 Difference]: Without dead ends: 13824 [2018-11-28 13:28:57,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:28:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13824 states. [2018-11-28 13:28:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13824 to 9525. [2018-11-28 13:28:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9525 states. [2018-11-28 13:28:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9525 states to 9525 states and 21804 transitions. [2018-11-28 13:28:57,240 INFO L78 Accepts]: Start accepts. Automaton has 9525 states and 21804 transitions. Word has length 92 [2018-11-28 13:28:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:57,240 INFO L480 AbstractCegarLoop]: Abstraction has 9525 states and 21804 transitions. [2018-11-28 13:28:57,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:28:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 9525 states and 21804 transitions. [2018-11-28 13:28:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:57,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:57,249 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] [2018-11-28 13:28:57,249 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:57,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash -952422607, now seen corresponding path program 1 times [2018-11-28 13:28:57,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:57,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:57,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:57,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:57,356 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 13:28:57,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:57,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:28:57,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:28:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:28:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:28:57,357 INFO L87 Difference]: Start difference. First operand 9525 states and 21804 transitions. Second operand 6 states. [2018-11-28 13:28:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:57,409 INFO L93 Difference]: Finished difference Result 12099 states and 27770 transitions. [2018-11-28 13:28:57,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:28:57,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 13:28:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:57,418 INFO L225 Difference]: With dead ends: 12099 [2018-11-28 13:28:57,418 INFO L226 Difference]: Without dead ends: 12099 [2018-11-28 13:28:57,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:28:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12099 states. [2018-11-28 13:28:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12099 to 9787. [2018-11-28 13:28:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9787 states. [2018-11-28 13:28:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9787 states to 9787 states and 22259 transitions. [2018-11-28 13:28:57,510 INFO L78 Accepts]: Start accepts. Automaton has 9787 states and 22259 transitions. Word has length 92 [2018-11-28 13:28:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:57,510 INFO L480 AbstractCegarLoop]: Abstraction has 9787 states and 22259 transitions. [2018-11-28 13:28:57,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:28:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9787 states and 22259 transitions. [2018-11-28 13:28:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:57,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:57,518 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] [2018-11-28 13:28:57,518 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:57,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:57,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1413054320, now seen corresponding path program 1 times [2018-11-28 13:28:57,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:57,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:57,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:57,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:57,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:57,658 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 13:28:57,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:28:57,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:28:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:28:57,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:28:57,659 INFO L87 Difference]: Start difference. First operand 9787 states and 22259 transitions. Second operand 7 states. [2018-11-28 13:28:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:57,823 INFO L93 Difference]: Finished difference Result 13159 states and 30272 transitions. [2018-11-28 13:28:57,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:28:57,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-28 13:28:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:57,834 INFO L225 Difference]: With dead ends: 13159 [2018-11-28 13:28:57,834 INFO L226 Difference]: Without dead ends: 13159 [2018-11-28 13:28:57,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:28:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13159 states. [2018-11-28 13:28:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13159 to 9185. [2018-11-28 13:28:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9185 states. [2018-11-28 13:28:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9185 states to 9185 states and 20791 transitions. [2018-11-28 13:28:57,935 INFO L78 Accepts]: Start accepts. Automaton has 9185 states and 20791 transitions. Word has length 92 [2018-11-28 13:28:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:57,935 INFO L480 AbstractCegarLoop]: Abstraction has 9185 states and 20791 transitions. [2018-11-28 13:28:57,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:28:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9185 states and 20791 transitions. [2018-11-28 13:28:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 13:28:57,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:57,943 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] [2018-11-28 13:28:57,944 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:57,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash -318921232, now seen corresponding path program 1 times [2018-11-28 13:28:57,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:58,029 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 13:28:58,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:58,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:28:58,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:28:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:28:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:28:58,030 INFO L87 Difference]: Start difference. First operand 9185 states and 20791 transitions. Second operand 6 states. [2018-11-28 13:28:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:58,124 INFO L93 Difference]: Finished difference Result 8913 states and 19839 transitions. [2018-11-28 13:28:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:28:58,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 13:28:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:58,131 INFO L225 Difference]: With dead ends: 8913 [2018-11-28 13:28:58,131 INFO L226 Difference]: Without dead ends: 8913 [2018-11-28 13:28:58,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:28:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8913 states. [2018-11-28 13:28:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8913 to 5230. [2018-11-28 13:28:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2018-11-28 13:28:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 11603 transitions. [2018-11-28 13:28:58,192 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 11603 transitions. Word has length 92 [2018-11-28 13:28:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:58,192 INFO L480 AbstractCegarLoop]: Abstraction has 5230 states and 11603 transitions. [2018-11-28 13:28:58,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:28:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 11603 transitions. [2018-11-28 13:28:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:28:58,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:58,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:58,197 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:58,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 807747209, now seen corresponding path program 1 times [2018-11-28 13:28:58,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:58,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:58,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:58,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:58,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:58,321 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 13:28:58,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:58,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:28:58,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:28:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:28:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:28:58,322 INFO L87 Difference]: Start difference. First operand 5230 states and 11603 transitions. Second operand 5 states. [2018-11-28 13:28:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:58,368 INFO L93 Difference]: Finished difference Result 5230 states and 11587 transitions. [2018-11-28 13:28:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:28:58,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 13:28:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:58,372 INFO L225 Difference]: With dead ends: 5230 [2018-11-28 13:28:58,373 INFO L226 Difference]: Without dead ends: 5230 [2018-11-28 13:28:58,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 13:28:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2018-11-28 13:28:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 5230. [2018-11-28 13:28:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2018-11-28 13:28:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 11587 transitions. [2018-11-28 13:28:58,412 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 11587 transitions. Word has length 94 [2018-11-28 13:28:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:58,413 INFO L480 AbstractCegarLoop]: Abstraction has 5230 states and 11587 transitions. [2018-11-28 13:28:58,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:28:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 11587 transitions. [2018-11-28 13:28:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:28:58,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:58,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:58,417 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:58,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1695250890, now seen corresponding path program 1 times [2018-11-28 13:28:58,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:58,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:58,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:58,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:58,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:28:58,556 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 13:28:58,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:58,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:28:58,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:28:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:28:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:28:58,558 INFO L87 Difference]: Start difference. First operand 5230 states and 11587 transitions. Second operand 11 states. [2018-11-28 13:28:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:59,620 INFO L93 Difference]: Finished difference Result 10618 states and 23714 transitions. [2018-11-28 13:28:59,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:28:59,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-28 13:28:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:59,626 INFO L225 Difference]: With dead ends: 10618 [2018-11-28 13:28:59,626 INFO L226 Difference]: Without dead ends: 7440 [2018-11-28 13:28:59,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:28:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2018-11-28 13:28:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 5311. [2018-11-28 13:28:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2018-11-28 13:28:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 11673 transitions. [2018-11-28 13:28:59,676 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 11673 transitions. Word has length 94 [2018-11-28 13:28:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:59,676 INFO L480 AbstractCegarLoop]: Abstraction has 5311 states and 11673 transitions. [2018-11-28 13:28:59,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:28:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 11673 transitions. [2018-11-28 13:28:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:28:59,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:28:59,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:28:59,680 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:28:59,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:28:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1222654462, now seen corresponding path program 2 times [2018-11-28 13:28:59,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:28:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:28:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:59,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:28:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:28:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:28:59,739 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:28:59,834 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:28:59,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:28:59 BasicIcfg [2018-11-28 13:28:59,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:28:59,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:28:59,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:28:59,836 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:28:59,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:28:41" (3/4) ... [2018-11-28 13:28:59,838 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:28:59,941 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32db8f37-a911-4aa9-955c-233881c6d533/bin-2019/uautomizer/witness.graphml [2018-11-28 13:28:59,941 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:28:59,942 INFO L168 Benchmark]: Toolchain (without parser) took 19388.93 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 949.5 MB in the beginning and 1.6 GB in the end (delta: -689.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-28 13:28:59,943 INFO L168 Benchmark]: CDTParser took 0.17 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 13:28:59,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:59,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.56 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 13:28:59,944 INFO L168 Benchmark]: Boogie Preprocessor took 25.82 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 13:28:59,944 INFO L168 Benchmark]: RCFGBuilder took 536.48 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:59,945 INFO L168 Benchmark]: TraceAbstraction took 18261.79 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -602.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-28 13:28:59,945 INFO L168 Benchmark]: Witness Printer took 105.75 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:59,947 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.17 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 412.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.56 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.82 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 536.48 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18261.79 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -602.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 105.75 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] -1 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L769] FCALL, FORK -1 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 1 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 2 [L730] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 1 y$flush_delayed = weak$$choice2 [L733] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$flush_delayed ? y$mem_tmp : y [L743] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] EXPR 1 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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] [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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] [L748] 1 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 [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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] [L749] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L750] EXPR 1 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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] [L750] 1 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 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=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 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=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -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) [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L779] 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=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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 [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L781] 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=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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 [L784] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. UNSAFE Result, 18.1s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7654 SDtfs, 7809 SDslu, 17915 SDs, 0 SdLazy, 6742 SolverSat, 361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 79 SyntacticMatches, 29 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34805occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 81089 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2283 NumberOfCodeBlocks, 2283 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2159 ConstructedInterpolants, 0 QuantifiedInterpolants, 455552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...